Constraints in Term Algebras (Short Survey)

First, we define what is a constraint system and list few possible applications of them. Then, we survey recent results on constraint in term algebras. Finally, we propose a methodology of constraint solving and illustrate it on a toy example.

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

[2]  Jean-Pierre Jouannaud,et al.  Open Problems in Rewriting , 1991, RTA.

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

[4]  Max Dauchet,et al.  Encompassment Properties and Automata with Constraints , 1993, RTA.

[5]  Ricardo Caferra,et al.  A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving , 1992, J. Symb. Comput..

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

[7]  Nachum Dershowitz,et al.  Termination of Rewriting , 1987, J. Symb. Comput..

[8]  C. Kirchner,et al.  Deduction with symbolic constraints , 1990 .

[9]  Hubert Comon,et al.  Disunification: A Survey. , 1991 .

[10]  Hubert Comon-Lundh,et al.  About the Theory of Tree Embedding , 1993, TAPSOFT.

[11]  Hong Chen,et al.  Logic Programming with Recurrence Domains , 1991, ICALP.

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

[13]  Hubert Comon,et al.  Complete axiomatizations of some quotient term algebras , 1991 .

[14]  LEO BACHMAIR,et al.  Termination Orderings for Associative-Commutative Rewriting Systems , 1985, J. Symb. Comput..

[15]  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.

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

[17]  Thom W. Frühwirth,et al.  Logic programs as types for logic programs , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[18]  Gert Smolka,et al.  A Complete and Recursive Feature Theory , 1993, ACL.

[19]  Hubert Comon.  Completion of Rewrite Systems with Membership Constraints , 1992 .

[20]  Sophie Tison,et al.  Solving Systems of Set Constraints using Tree Automata , 1993, STACS.

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

[22]  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.

[23]  W. V. Quine,et al.  Concatenation as a basis for arithmetic , 1946, Journal of Symbolic Logic.

[24]  Eric Domenjoud.  AC unification through order-sorted AC1 unification , 1992 .

[25]  Alexander Aiken,et al.  Solving systems of set constraints , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[26]  Claude Kirchner,et al.  Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification , 1991, Computational Logic - Essays in Honor of Alan Robinson.

[27]  Wayne Snyder,et al.  Basic Paramodulation and Superposition , 1992, CADE.

[28]  Gernot Salzer,et al.  The Unification of Infinite Sets of Terms and Its Applications , 1992, LPAR.

[29]  Hubert Comon-Lundh,et al.  Equational Formulae with Membership Constraints , 1994, Inf. Comput..

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

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

[32]  Albert Rubio,et al.  Basic Superposition is Complete , 1992, ESOP.

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

[34]  Robert Nieuwenhuis,et al.  Simple LPO Constraint Solving Methods , 1993, Inf. Process. Lett..

[35]  Jean-Pierre Jouannaud,et al.  Termination and Completion Modulo Associativity, Commutativity and Identity , 1992, Theor. Comput. Sci..

[36]  Harald Ganzinger,et al.  Set constraints are the monadic class , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[38]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[39]  Albert Rubio,et al.  Theorem Proving with Ordering Constrained Clauses , 1992, CADE.

[40]  Ralf Treinen.  A New Method for Undecidablity Proofs of First Order Theories , 1992, J. Symb. Comput..