Predicate Anti-unification in (Constraint) Logic Programming

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférenceArticle dans les actes d'une conférence/un colloque

15 Téléchargements (Pure)


The concept of anti-unification refers to the process of determining the most specific generalization (msg) of two or more input program objects. In the domain of logic programming, anti-unification has primarily been investigated for computing msgs of tree-like program structures such as terms, atoms, and goals (the latter typically seen as ordered sequences).

In this work, we study the anti-unification 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.
langue originaleAnglais
titreLogic-Based Program Synthesis and Transformation - 33rd International Symposium, LOPSTR 2023, Proceedings
Sous-titreLogic-Based Program Synthesis and Transformation. LOPSTR 2023.
rédacteurs en chefRobert Glück, Bishoksan Kafle
EditeurSpringer, Cham
Nombre de pages19
ISBN (Electronique)978-3-031-45784-5
ISBN (imprimé)978-3-031-45783-8
Les DOIs
Etat de la publicationPublié - 16 oct. 2023
Evénement33rd International Symposium on Logic-based Program Synthesis and Transformation - Cascais, Lisbonne, Portugal
Durée: 23 oct. 202324 oct. 2023

Série de publications

NomLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14330 LNCS
ISSN (imprimé)0302-9743
ISSN (Electronique)1611-3349

Une conférence

Une conférence33rd International Symposium on Logic-based Program Synthesis and Transformation
Titre abrégéLOPSTR 2023
La villeLisbonne

Empreinte digitale

Examiner les sujets de recherche de « Predicate Anti-unification in (Constraint) Logic Programming ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation