Activités par an
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.
Gonzague Yernaux (Participant)20 sept. 2019 → 25 sept. 2019
Activité: Types de Participation ou d'organisation d'un événement › Participation à une conférence, un congrès