Nominal anti-unification with atom-variables
Shranjeno v:
| Glavni avtor: | |
|---|---|
| Publication Date: | 2022 |
| Drugi avtorji: | |
| Jezik: | eng |
| Source: | Repositório Institucional da UnB |
| Download full: | http://repositorio2.unb.br/jspui/handle/10482/46038 https://orcid.org/0000-0001-8809-7385 https://orcid.org/0000-0002-1959-8730 |
Izvleček: | Anti-unification is the task of generalizing a set of expressions in the most specific way. It was extended to the nominal framework by Baumgarter, Kutsia, Levy and Villaret, who defined an algorithm solving the nominal anti-unification problem, which runs in polynomial time. Unfortunately, when an infinite set of atoms are allowed in generalizations, a minimal complete set of solutions in nominal anti-unification does not exist, in general. In this paper, we present a more general approach to nominal anti-unification that uses atom-variables instead of explicit atoms, and two variants of freshness constraints: NLA-constraints (with atom-variables), and Eqr-constraints based on Equivalence relations on atom-variables. The idea of atom-variables is that different atom-variables may be instantiated with identical or different atoms. Albeit simple, this freedom in the formulation increases its application potential: we provide an algorithm that is finitary for the NLA-freshness constraints, and for Eqr-freshness constraints it computes a unique least general generalization. There is a price to pay in the general case: checking freshness constraints and other related logical questions will require exponential time. The setting of Baumgartner et al. is improved by the atom-only case, which runs in polynomial time and computes a unique least general generalization |