Generalizing Generalization: towards a framework for anti-unification problems in Logic Programming

Research output: Contribution to conferencePaper

Abstract

Anti-unification (the dual operation of unification) is typically de-fined as a computing process that outputs a program object (calleda generalization) when other program objects of a similar natureare given as inputs. The computed generalization must be moregeneral than all input objects with respect to a given generalizationrelation, and usually some optimization is required in order to findthe "most specific" or "best" possible generalization according tosome criterion, rather than any common generalization. In logic pro-gramming contexts, many independent anti-unification approachesexist – each with its own interesting specificities – but no effort hasyet been done in the literature to devise a synthetic framework foranti-unification. We believe that such an effort would not only pro-vide possibilities for replacing existing anti-unification algorithmsby slightly different and perhaps more adequate or more efficientsolutions, but also highlight specific configurations for which noalgorithm even exists at the moment, although the anti-unificationproblems falling into said configurations could be numerous inpractice. This short paper first aims to formalize the concept ofconfiguration as a foundation for such a theory of generalization.It will pursue related work in the exploration of specific configu-rations that haven’t been thoroughly studied before (such as un-ordered goals anti-unification). Throughout the paper we describeand motivate ongoing and potential future work in the vast area ofanti-unification techniques in logic programming.
Original languageEnglish
Number of pages7
Publication statusUnpublished - 22 Nov 2019
EventGrascomp Doctoral Day - UNamur - Faculté d'Informatique, Namur, Belgium
Duration: 22 Nov 201922 Nov 2019

Conference

ConferenceGrascomp Doctoral Day
Abbreviated titleGDD19
CountryBelgium
CityNamur
Period22/11/1922/11/19

Fingerprint

Logic programming

Cite this

@conference{016f1098960a4b65a8e85b05c8a5ff28,
title = "Generalizing Generalization: towards a framework for anti-unification problems in Logic Programming",
abstract = "Anti-unification (the dual operation of unification) is typically de-fined as a computing process that outputs a program object (calleda generalization) when other program objects of a similar natureare given as inputs. The computed generalization must be moregeneral than all input objects with respect to a given generalizationrelation, and usually some optimization is required in order to findthe {"}most specific{"} or {"}best{"} possible generalization according tosome criterion, rather than any common generalization. In logic pro-gramming contexts, many independent anti-unification approachesexist – each with its own interesting specificities – but no effort hasyet been done in the literature to devise a synthetic framework foranti-unification. We believe that such an effort would not only pro-vide possibilities for replacing existing anti-unification algorithmsby slightly different and perhaps more adequate or more efficientsolutions, but also highlight specific configurations for which noalgorithm even exists at the moment, although the anti-unificationproblems falling into said configurations could be numerous inpractice. This short paper first aims to formalize the concept ofconfiguration as a foundation for such a theory of generalization.It will pursue related work in the exploration of specific configu-rations that haven’t been thoroughly studied before (such as un-ordered goals anti-unification). Throughout the paper we describeand motivate ongoing and potential future work in the vast area ofanti-unification techniques in logic programming.",
author = "Gonzague Yernaux",
year = "2019",
month = "11",
day = "22",
language = "English",
note = "null ; Conference date: 22-11-2019 Through 22-11-2019",

}

Yernaux, G 2019, 'Generalizing Generalization: towards a framework for anti-unification problems in Logic Programming', Paper presented at Grascomp Doctoral Day, Namur, Belgium, 22/11/19 - 22/11/19.

Generalizing Generalization : towards a framework for anti-unification problems in Logic Programming. / Yernaux, Gonzague.

2019. Paper presented at Grascomp Doctoral Day, Namur, Belgium.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Generalizing Generalization

T2 - towards a framework for anti-unification problems in Logic Programming

AU - Yernaux, Gonzague

PY - 2019/11/22

Y1 - 2019/11/22

N2 - Anti-unification (the dual operation of unification) is typically de-fined as a computing process that outputs a program object (calleda generalization) when other program objects of a similar natureare given as inputs. The computed generalization must be moregeneral than all input objects with respect to a given generalizationrelation, and usually some optimization is required in order to findthe "most specific" or "best" possible generalization according tosome criterion, rather than any common generalization. In logic pro-gramming contexts, many independent anti-unification approachesexist – each with its own interesting specificities – but no effort hasyet been done in the literature to devise a synthetic framework foranti-unification. We believe that such an effort would not only pro-vide possibilities for replacing existing anti-unification algorithmsby slightly different and perhaps more adequate or more efficientsolutions, but also highlight specific configurations for which noalgorithm even exists at the moment, although the anti-unificationproblems falling into said configurations could be numerous inpractice. This short paper first aims to formalize the concept ofconfiguration as a foundation for such a theory of generalization.It will pursue related work in the exploration of specific configu-rations that haven’t been thoroughly studied before (such as un-ordered goals anti-unification). Throughout the paper we describeand motivate ongoing and potential future work in the vast area ofanti-unification techniques in logic programming.

AB - Anti-unification (the dual operation of unification) is typically de-fined as a computing process that outputs a program object (calleda generalization) when other program objects of a similar natureare given as inputs. The computed generalization must be moregeneral than all input objects with respect to a given generalizationrelation, and usually some optimization is required in order to findthe "most specific" or "best" possible generalization according tosome criterion, rather than any common generalization. In logic pro-gramming contexts, many independent anti-unification approachesexist – each with its own interesting specificities – but no effort hasyet been done in the literature to devise a synthetic framework foranti-unification. We believe that such an effort would not only pro-vide possibilities for replacing existing anti-unification algorithmsby slightly different and perhaps more adequate or more efficientsolutions, but also highlight specific configurations for which noalgorithm even exists at the moment, although the anti-unificationproblems falling into said configurations could be numerous inpractice. This short paper first aims to formalize the concept ofconfiguration as a foundation for such a theory of generalization.It will pursue related work in the exploration of specific configu-rations that haven’t been thoroughly studied before (such as un-ordered goals anti-unification). Throughout the paper we describeand motivate ongoing and potential future work in the vast area ofanti-unification techniques in logic programming.

M3 - Paper

ER -