On Anti-unification in Absorption Theories
Résumé
The anti-unification problem for theories with absorption constants and operators such as zero for product or true and false for disjunction and conjuction is addressed. A proved sound algorithm that computes generalizations is introduced. Although the problem is at least of type infinitary, the algorithm computes a finite set of final configurations from which the least general generalizations are built.
Domaines
Informatique [cs]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
