Activities per year
Abstract
The concept of antiunification refers to the process of determining the most specific generalization (msg) of two or more input program objects. In the domain of logic programming, antiunification has primarily been investigated for computing msgs of treelike program structures such as terms, atoms, and goals (the latter typically seen as ordered sequences).
In this work, we study the antiunification of whole predicate definitions. We provide a definition of a predicate generalization that allows to characterize the problem of finding the most specific generalization of two predicates as a (computationally hard) search problem. The complexity stems from the fact that a correspondence needs to be constructed between (1) some of the arguments of each of the predicates, (2) some of the clauses in each of the predicate's definitions, and (3) some of the body atoms in each pair of associated clauses. We propose a working algorithm that simultaneously computes these correspondences in a greedy manner. While our algorithm does not necessarily compute the most specific generalization, we conjecture that it allows to compute, in general, a sufficiently good generalization in an acceptable time.
In this work, we study the antiunification of whole predicate definitions. We provide a definition of a predicate generalization that allows to characterize the problem of finding the most specific generalization of two predicates as a (computationally hard) search problem. The complexity stems from the fact that a correspondence needs to be constructed between (1) some of the arguments of each of the predicates, (2) some of the clauses in each of the predicate's definitions, and (3) some of the body atoms in each pair of associated clauses. We propose a working algorithm that simultaneously computes these correspondences in a greedy manner. While our algorithm does not necessarily compute the most specific generalization, we conjecture that it allows to compute, in general, a sufficiently good generalization in an acceptable time.
Original language  English 

Title of host publication  LogicBased Program Synthesis and Transformation  33rd International Symposium, LOPSTR 2023, Proceedings 
Subtitle of host publication  LogicBased Program Synthesis and Transformation. LOPSTR 2023. 
Editors  Robert Glück, Bishoksan Kafle 
Publisher  Springer, Cham 
Pages  131149 
Number of pages  19 
Volume  14330 
ISBN (Electronic)  9783031457845 
ISBN (Print)  9783031457838 
DOIs  
Publication status  Published  16 Oct 2023 
Event  33rd International Symposium on Logicbased Program Synthesis and Transformation  Cascais, Lisbonne, Portugal Duration: 23 Oct 2023 → 24 Oct 2023 
Publication series
Name  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 

Volume  14330 LNCS 
ISSN (Print)  03029743 
ISSN (Electronic)  16113349 
Conference
Conference  33rd International Symposium on Logicbased Program Synthesis and Transformation 

Abbreviated title  LOPSTR 2023 
Country/Territory  Portugal 
City  Lisbonne 
Period  23/10/23 → 24/10/23 
Keywords
 Antiunification
 Generalization
 Approximation algorithm
 Approximation Algorithm
Fingerprint
Dive into the research topics of 'Predicate Antiunification in (Constraint) Logic Programming'. Together they form a unique fingerprint.
Predicate Antiunification in (Constraint) Logic Programming
Yernaux, G. (Speaker)
Oct 2023Activity: Talk or presentation types › Oral presentation

33rd International Symposium on Logicbased Program Synthesis and Transformation
Yernaux, G. (Participant)
23 Oct 2023 → 24 Oct 2023Activity: Participating in or organising an event types › Participation in conference