A Library of Anti-unification Algorithms

Abstract

Abstract. Generalization problems arise in many branches of artificial intelligence: machine learning, analogical and case-based reasoning, cognitive modeling, knowledge discovery, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for firstand second-order unranked terms, higher-order patterns, and nominal terms.

Higher-order pattern generalization modulo equational theories

“…Some application areas include proof generalization (Pfenning, 1991), higher-order term indexing (Pientka, 2009), cognitive modeling and analogical reasoning (Besold et al, 2017;Schmidt et al, 2014), recursion scheme detection in functional programs (Barwell et al, 2018), inductive synthesis of recursive functions (Schmid, 2003), learning fixes from software code repositories (Rolim et al, 2018), just to name a few. Two higher-order anti-unification algorithms are included in an online open-source anti-unification library (Baumgartner, 2015;Baumgartner and Kutsia, 2014). First-order order-sorted equational generalization algorithms from Alpuente et al (2014) have also been implemented and are available online (Alpuente et al, 2019).…”

Anti-Unification and Natural Language Processing

“…This information is in the result computed by anti-unification. Our anti-unification algorithms are a part of RISC anti-unification algorithm library [6] and can be accessed from http://www.risc.jku.at/projects/stout/library.html. Particular algorithms from the library are described in [5,[7][8][9][10][11]29].…”