ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance (extended version)

Abstract

Computing generalizers is relevant in a wide spectrum of automated reasoning areas where analogical reasoning and inductive inference are needed. The ACUOS system computes a complete and minimal set of semantic generalizers (also called \anti-uni ers") of two structures in a typed language modulo a set of equational axioms. By supporting types and any combination of associativity (A), commutativity (C), and unity (U) algebraic axioms for function symbols, ACUOS allows reasoning about typed data structures, e.g. lists, trees, and (multi-)sets, and typical hierarchical/structural relations such as is a and part of. This paper discusses the modular ACU generalization tool ACUOS and illustrates its use in a classical arti ficial intelligence problem.