A Library of Anti-unification Algorithms
From MaRDI portal
Publication:2938520
DOI10.1007/978-3-319-11558-0_38zbMath1432.68426OpenAlexW375631553MaRDI QIDQ2938520
Alexander Baumgartner, Temur Kutsia
Publication date: 14 January 2015
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_38
Related Items (3)
Higher-order pattern anti-unification in linear time ⋮ Unnamed Item ⋮ Higher-order pattern generalization modulo equational theories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient parallel term matching and anti-unification
- A new approach to abstract syntax with variable binding
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Bottom-up induction of feature terms
- Higher order generalization and its application in program verification
- Anti-unification for unranked terms and hedges
- A modular order-sorted equational generalization algorithm
- E-generalization using grammars
- Unranked Second-Order Anti-Unification
- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance
- A Variant of Higher-Order Anti-Unification
- Anti-unification Algorithms and Their Applications in Program Analysis
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Unification, weak unification, upper bound, lower bound, and generalization problems
- Nominal Anti-Unification
This page was built for publication: A Library of Anti-unification Algorithms