Anti-unification in Constraint Logic Programming

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

3 Téléchargements (Pure)


Anti-unification refers to the process of generalizing two (or more) goals into a single, more general, goal that captures some of the structure that is common to all initial goals. In general one is typically interested in computing what is often called a most specific generalization, that is a generalization that captures a maximal amount of shared structure.

In this work we address the problem of anti-unification in CLP, where goals can be seen as unordered sets of atoms and/or constraints. We show that while the concept of a most specific generalization can easily be defined in this context, computing it becomes an NP-complete problem. We subsequently introduce a generalization algorithm that computes a well-defined abstraction whose computation can be bound to a polynomial execution time. Initial experiments show that even a naive implementation of our algorithm produces acceptable generalizations in an efficient way.
langue originaleAnglais
Pages (de - à)773-789
Nombre de pages17
journalTheory and Practice of Logic Programming
Numéro de publication5-6
Les DOIs
Etat de la publicationPublié - 20 sept. 2019

Empreinte digitale

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

Contient cette citation