From Unification in Combination of Equational Theories to a New AC-Unification Algorithm

[1]  Jacques Herbrand.  Recherches sur la théorie de la démonstration , 1930 .

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

[3]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[4]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

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

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

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

[8]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[9]  Jörg H. Siekmann,et al.  Universal Unification , 1982, GWAI.

[10]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[11]  Michel Bidoit,et al.  A Rehabilitation of Robinson's Unification Algorithm , 1983, IFIP Congress.

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

[13]  Hélène Kirchner.  A General Inductive Completion Algorithm and Application to Abstract Data Types , 1984, CADE.

[14]  Claude Kirchner,et al.  A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm , 1984, CADE.

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

[16]  Claude Kirchner,et al.  NARROWER: A New Algorithm for Unification and Its Application to Logic Programming , 1985, RTA.

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

[18]  Stefan Arnborg,et al.  Unification Problems with One-Sided Distributivity , 1985, RTA.

[19]  Claude Kirchner.  Computing Unification Algorithms , 1986, LICS.

[20]  Jalel Mzali.  Méthodes de filtrage équationnel et de preuve automatique de théorèmes , 1986 .

[21]  Bruno Courcelle,et al.  Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars , 1986, Theor. Comput. Sci..

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

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

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

[25]  Hélène Kirchner,et al.  Completion of a Set of Rules Modulo a Set of Equations , 1986, SIAM J. Comput..

[26]  Paliath Narendran,et al.  NP-Completeness of the Set Unification and Matching Problems , 1986, CADE.

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

[28]  Pierre Réty.  Improving Basic Narrowing Techniques , 1987, RTA.

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

[30]  Jörg H. Siekmann.  Unification Theory , 1989, J. Symb. Comput..

[31]  Patrick Lincoln,et al.  Adventures in Associative-Commutative Unification , 1989, J. Symb. Comput..

[32]  Nachum Dershowitz,et al.  Completion for Rewriting Modulo a Congruence , 1987, Theor. Comput. Sci..