A New Algorithm for Computing Least Generalization of a Set of Atoms

This paper provides a new algorithm of computing a least generalization of a set of atoms. Our algorithm is based on the notion of anti-combination that is the inverse substitution of a combined substitution. In contrast to an anti-unification algorithm that computes a least generalization of two atoms, anti-combination can compute a least generalization of (more than two) atoms in parallel. We evaluate the proposed algorithm using randomly generated data and show that anti-combination outperforms the iterative application of an anti-unification algorithm in general.

[1]  Simon Kasif,et al.  Efficient parallel term matching and anti-unification , 2004, Journal of Automated Reasoning.

[2]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[3]  Michael J. Maher,et al.  Unification Revisited , 1988, Foundations of Deductive Databases and Logic Programming..

[4]  Catuscia Palamidessi,et al.  Algebraic Properties of Idempotent Substitutions , 1990, ICALP.

[5]  Gabriel M. Kuper,et al.  A note on the parallel complexity of anti-unification , 2004, Journal of Automated Reasoning.

[6]  Elmar Eder.  Properties of Substitutions and Unifications , 1983, GWAI.

[7]  Gordon Plotkin,et al.  A Note on Inductive Generalization , 2008 .

[8]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[9]  John L. Gustafson.  Brent's Theorem , 2011, Encyclopedia of Parallel Computing.

[10]  John W. Lloyd,et al.  Foundations of Logic Programming, 1st Edition , 1984 .

[11]  Egor V. Kostylev,et al.  On complexity of the anti-unification problem , 2008 .

[12]  Shan-Hwei Nienhuys-Cheng,et al.  Foundations of Inductive Logic Programming , 1997, Lecture Notes in Computer Science.

[13]  Susumu Yamasaki,et al.  A Fixpoint Semantics of Horn Sentences Based on Substitution Sets , 1987, Theor. Comput. Sci..