Opening the AC-unification race

This note reports about the implementation of AC-unification algorithms, based on the variable-abstraction method of Stickel and on the constant-abstraction method of Livesey, Siekmann, and Herold. We give a set of 105 benchmark examples and compare execution times for implementations of the two approaches. This documents for other researchers what we consider to be the state-of-the-art performance for elementary AC-unification problems.

[1]  Manfred Schmidt-Schauß.  Unification in a Combination of Arbitrary Disjoint Equational Theories , 1988, CADE.

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Patrick Lincoln,et al.  Adventures in Associative-Commutative Unification (A Summary) , 1988, CADE.

[4]  Jean H. Gallier,et al.  SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification , 1986, SLP.

[5]  Norbert Eisinger,et al.  The Markgraf Karl Refutation Procedure (MKRP) , 1986, CADE.

[6]  José Meseguer,et al.  EQLOG: Equality, Types, and Generic Modules For Logic Programming , 1986, Logic Programming: Functions, Relations, and Equations.

[7]  Michael J. Maher,et al.  Logic Programming Language Scheme , 1986, Logic Programming: Functions, Relations, and Equations.

[8]  Jieh Hsiang,et al.  Topics in Automated Theorem Proving and Program Generation , 1983 .

[9]  J. Goguen,et al.  Order-Sorted Equational Computation , 1989 .

[10]  Hans-Jürgen Bürckert.  Lazy Theory Unification inProlog: An Extension of the warren Abstract machine , 1986, GWAI.

[11]  Gérard P. Huet,et al.  An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations , 1978, Inf. Process. Lett..

[12]  Mark E. Stickel.  A comparison of the variable-abstraction and constant-abstraction methods for associative-commutative unification , 2004, Journal of Automated Reasoning.

[13]  François Fages,et al.  Complete Sets of Unifiers and Matchers in Equational Theories , 1983, CAAP.

[14]  Mark E. Stickel.  A Complete Unification Algorithm for Associative-Commutative Functions , 1975, IJCAI.

[15]  Nachum Dershowitz,et al.  Rewrite Methods for Clausal and Non-Clausal Theorem Proving , 1983, ICALP.

[16]  Albrecht Fortenbacher.  An Algebraic Approach to Unification Under Associativity and Commutativity , 1987, J. Symb. Comput..

[17]  François Fages.  Associative-Commutative Unification , 1987, J. Symb. Comput..

[18]  Mark Edward Stickel.  Mechanical theorem proving and artificial intelligence languages. , 1977 .

[19]  François Fages,et al.  Associative-Commutative Unification , 1984, CADE.

[20]  Wolfram Büttner.  Unification in datastructure multisets , 2004, Journal of Automated Reasoning.

[21]  Albrecht Fortenbacher.  An algebraic approach to unification under associativity and commutativity , 1985 .

[22]  Hans-Jürgen Bürckert,et al.  On Equational Theories, Unification and Decidability , 1987, RTA.

[23]  Mark E. Stickel,et al.  Automated deduction by theory resolution , 1985, Journal of Automated Reasoning.

[24]  Hans Jürgen Ohlbach.  Link inheritance in abstract clause graphs , 2004, Journal of Automated Reasoning.

[25]  Mark E. Stickel,et al.  Complete Sets of Reductions for Some Equational Theories , 1981, JACM.

[26]  Jean-Pierre Jouannaud,et al.  Unification in Boolean Rings and Abelian Groups , 1989, J. Symb. Comput..

[27]  Katherine A. Yelick,et al.  Combining Unification Algorithms for Confined Regular Equational Theories , 1985, RTA.

[28]  Hélène Kirchner,et al.  Completion of a set of rules modulo a set of equations , 1984, SIAM J. Comput..

[29]  Mark E. Stickel,et al.  A Unification Algorithm for Associative-Commutative Functions , 1981, JACM.

[30]  Lawrence J. Henschen,et al.  A New Approach to Universal Unification and Its Application to AC-Unification , 1988, CADE.

[31]  Laurent Fribourg,et al.  A Superposition Oriented Theorem Prover , 1983, IJCAI.

[32]  Jieh Hsiang,et al.  Two Results in Term Rewriting Theorem Proving , 1985, RTA.

[33]  Jürgen Müller.  THEOPOGLES - A Theorem Prover Based on First-Order Polynominals and a Special Knuth-Bendix Procedure , 1987, GWAI.

[34]  Ricardo Caferra,et al.  Some Tools for an Inference Laboratory (ATINF) , 1988, CADE.

[35]  Jörg H. Siekmann,et al.  Unification in Abelian semigroups , 1987, Journal of Automated Reasoning.

[36]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[37]  Claude Kirchner,et al.  Implementation of a General Completion Procedure Parameterized by Built-in Theories and Strategies , 1985, European Conference on Computer Algebra.

[38]  Erik Tidén.  Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols , 1986, CADE.

[39]  Deepak Kapur,et al.  RRL: A Rewrite Rule Laboratory , 1986, CADE.

[40]  Michael Clausen,et al.  Efficient Solution of Linear Diophantine Equations , 1989, J. Symb. Comput..

[41]  Mark E. Stickel,et al.  A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity , 1984, CADE.

[42]  Hans-Jürgen Bürckert.  Solving Disequations in Equational Theories , 1988, CADE.

[43]  Jörg H. Siekmann,et al.  The Markgraf Karl Refutation Procedure , 1980, IJCAI.

[44]  Hans-Jürgen Bitrckert.  Lazy Theory Unification in Prolog: An Extension of the Warren Abstract Machine , 1986 .

[45]  Alexander Herold.  Combination of Unification Algorithms , 1986, CADE.