From the 1 of 6 linked papers with an AI index.
6 papers
Anti-Unification Completeness Analysis in PVS
Mauricio Ayala-Rincón, Thaynara Arielly de Lima, Maria Júlia Dias Lima +2
The paper formally proves the completeness of a rule‑based syntactic anti‑unification algorithm within the Prototype Verification System (PVS), detailing the differences between an…
Generalization of Variadic Structures with Binders: A Tool for Structural Code Comparison
Alexander Baumgartner, Temur Kutsia
This paper introduces a novel anti-unification algorithm for the generalization of variadic structures with binders, designed as a flexible tool for structural code comparison. By…
Graded Quantitative Narrowing
Mauricio Ayala-Rincón, Thaynara Arielly de Lima, Georg Ehling +1
The recently introduced framework of Graded Quantitative Rewriting is an innovative extension of traditional rewriting systems, in which rules are annotated with degrees drawn from…
Higher-Order Pattern Unification Modulo Similarity Relations
Besik Dundua, Temur Kutsia
The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches…
Nominal anti-unification
Alexander Baumgartner, Temur Kutsia, Jordi Levy +1
We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general…
Generalization Problems with Atom-Variables in Languages with Binders and Equational Theories
Daniele Nantes-Sobrinho, Manfred Schmidt-Schauss, Alexander Baumgartner +1
Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints…