Solved forms for path ordering constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1631, Issue , 1999, Pages 1-15

  Nieuwenhuis, Robert ^a   Rivero, José Miguel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); LOGIC PROGRAMMING;

CONSTRAINT SOLVING; FUNDAMENTAL PROPERTIES; ORDERING CONSTRAINTS; ORDERS OF MAGNITUDE; POLYNOMIAL ALGORITHM; RECURSIVE PATH ORDERING; THEORETICAL POINTS; TRANSFORMATION RULES;

ALGORITHMS;

EID: 84957711893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48685-2_1     Document Type: Conference Paper

References (12)

1. CNNR98. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, and Michael Rusinowitch. Decision problems in ordered rewriting. In 13th IEEE Symp. Logic in Comp. Sc. (LICS), pages 410-422, Indianapolis, USA, 1998.
2. Com90. Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387-411, 1990.
3. CT94. Hubert Comon and Ralf Treinen. Ordering Constraints on Trees. In Proc. CAAP, LNCS 787, Edinburgh, Scotland, Springer-Verlag.
4. Der87. Nachum Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3:69-116, 1987.
5. GNN95. Harald Ganzinger, Robert Nieuwenhuis, and Pilar Nivela. The Saturate System, 1995. (see www.mpi-sb.mpg.de/SATURATE/Saturate.html).
6. JO91. J-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the subterm property is decidable. In Proc 18th ICALP, LNCS 510, Madrid, Spain, July 16-20 1991. Springer-Verlag.
7. KKR90. Claude Kirchner, Hélène Kirchner, and Michaël Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4(3):9-52, 1990.
8. KNS85. Deepak Kapur, Paliath Narendran, and G. Sivakumar. A path ordering for proving termination for term rewriting systems. In Proc. of 10th ICALP, LNCS 185, pages 173-185, Germany, 1985. Springer-Verlag.
9. Les90. Pierre Lescanne. On the recursive decomposition ordering with lexicographical status and other related orderings. J. Aut. Reasoning, 6(1):39-49, 1990.
10. Nie93. Robert Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters, 47:65-69, August 1993.
11. NR95. Robert Nieuwenhuis and Albert Rubio. Theorem Proving with Ordering and Equality Constrained Clauses. J. Symbolic Comp., 19(4):321-351, 1995.
12. NRV98. P. Narendran, M. Rusinowitch, and R. Verma. RPO constraint solving is in NP. In CSL 98, Brno, Czech Republic, August 23-28, 1998. Abstract at http://www.dbai.tuwien.ac.at/CSL98.