Disunification: A Survey.

Solving an equation in an algebra of terms is known as uniication. Solving more complex formulas combining equations and involving in particular negation is called disuniication. With such a broad deenition, many works fall into the scope of disuniication. The goal of this paper is to survey these works and bring them together in a same framework.

[1]  Greg Nelson,et al.  Fast Decision Procedures Based on Congruence Closure , 1980, JACM.

[2]  Michael J. O'Donnell,et al.  Equational Logic as a Programming Language. , 1987 .

[3]  Claude Kirchner,et al.  Solving Disequations , 1987, LICS.

[4]  A. I. Malcev.  Axiomatizable classes of locally free algebras of various types , 1971 .

[5]  Kenneth Kunen,et al.  Answer Sets and Negation-as-Failure , 1987, ICLP.

[6]  Jean-Louis Lassez,et al.  Independence of Negative Constraints , 1989, TAPSOFT, Vol.1.

[7]  Philippe Schnoebelen,et al.  Rewriting Techniques for the Temporal Analysis of Communicating Processes , 1987, PARLE.

[8]  Alain Laville.  Lazy pattern matching in the ML language , 1987, FSTTCS.

[9]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[10]  Wayne Snyder,et al.  A General Complete E-Unification Procedure , 1987, RTA.

[11]  Philippe Schnoebelen,et al.  Refined Compilation of Pattern-Matching for Functional Languages , 1988, Sci. Comput. Program..

[12]  Hubert Comon-Lundh,et al.  An Effective Method for Handling Initial Algebras , 1988, International Conference on Algebraic and Logic Programming.

[13]  Denis Lugiez.  A Deduction Procedure for First Order Programs , 1989, ICLP.

[14]  Michaël Rusinowitch,et al.  Proving refutational completeness of theorem-proving strategies: the transfinite semantic tree method , 1991, JACM.

[15]  Hubert Comon,et al.  Complete axiomatizations of some quotient term algebras , 1993 .

[16]  Franco Turini,et al.  A Transformational Approach to Negation in Logic Programming , 1990, J. Log. Program..

[17]  Ralf Treinen,et al.  A New Method for Undecidability Proofs of First Order Theories , 1990, FSTTCS.

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

[19]  Mandayam K. Srivas,et al.  Inference Rules and Proof Procedures for Inequations , 1990, J. Log. Program..

[20]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[21]  Kim Marriott,et al.  Explicit representation of terms defined by counter examples , 1986, Journal of Automated Reasoning.

[22]  Jean-Pierre Jouannaud,et al.  Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable , 1991, ICALP.

[23]  H. Comon.  Solving Inequations in Term Algebras (Extended Abstract ) , 1990, LICS 1990.

[24]  Alain Colmerauer.  Une introduction à Prolog III , 1989 .

[25]  Alain Colmerauer,et al.  Equations and Inequations on Finite and Infinite Trees , 1984, FGCS.

[26]  Joxan Jaffar,et al.  A decision procedure for a class of set constraints , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[27]  K. N. Venkataraman,et al.  Decidability of the purely existential fragment of the theory of term algebras , 1987, JACM.

[28]  Gregory Kucherov,et al.  A New Quasi-Reducibility Testing Algorithm and its Application to Proofs by Induction , 1988, ALP.

[29]  Simon J. Thompson.  Laws in Miranda , 1986, LFP '86.

[30]  Laurence Puel,et al.  Compiling Pattern Matching by Term Decomposition , 1993, J. Symb. Comput..

[31]  Michael J. Maher.  Complete axiomatizations of the algebras of finite, rational and infinite trees , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[32]  Hubert Comon-Lundh,et al.  Equational Problems and Disunification , 1989, J. Symb. Comput..

[33]  Hubert Comon.  Equational Formulas in Order-Sorted Algebras , 1990 .

[34]  H. Comon.  SOLVING SYMBOLIC ORDERING CONSTRAINTS , 1990 .

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