RPO constraint solving is in NP

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

Volumn 1584, Issue , 1999, Pages 385-398

  Narendran, Paliath ^a   Rusinowitch, Michael ^b   Verma, Rakesh ^c  

^a State University of New York   (United States)

^b LORIA   (France)

^c University of Houston   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NP-HARD; POLYNOMIAL APPROXIMATION;

COMPLEXITY CLASS; CONSTRAINT SOLVING; DECISION PROCEDURE; ORDERING CONSTRAINTS; POLYNOMIAL-TIME; RECURSIVE PATH ORDERING;

COMPUTER CIRCUITS;

EID: 84956990889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_26     Document Type: Conference Paper

References (17)

1. H. Comon. Solving inequations in term algebras. In Proc. 5th IEEE Symp. Logic in Computer Science (LICS), Philadelphia, June 1990. 386, 386, 388
2. H. Comon and R. Treinen. The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science 176, Apr. 1997.
3. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science 17(3): 279-301. 1982. 385, 387
4. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation 3(1):69-115, Feb. 1987.
5. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-309. North- Holland, 1990.
6. H. Ganzinger, R. Nieuwenhuis, and P. Nivela. The Saturate System, 1995. Software and documentation available from: www.mpi-sb.mpg.de. 385
7. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In T. Ottmann, editor, 14th International Colloquium, on Automata, Languages and Programming (ICALP), volume 267 of Lecture Notes in Computer Science, pages 54-71, Karlsruhe, Germany, July 1987. Springer-Verlag. 386
8. J.-P. Jouannaud and M. Okada. Satisfiability of systems of ordinal notations with the subterm ordering is decidable. In 18th International Colloquium on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 455-468, Madrid, Spain, July 1991. Springer-Verlag. 386, 386, 386, 396
9. D. Kapur, P. Narendran and G. Sivakumar. A path ordering for proving termination of term rewriting systems. In H. Ehrig (ed.), 10th CAAP, volume 185 of Lecture Notes in Computer Science, pages 173-187, Berlin, March 1985. 385
10. th conference on the Foundations of Software Technology and Theoretical Computer Science (FSTTCS-15), Bangalore, India, December 1995. 386, 387, 395, 395
11. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Revue Française d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on automatic deduction. 385, 386
12. M.S. Krishnamoorthy and P. Narendran. Note on recursive path ordering. TCS 40, pages 323-328. 1985.
13. P. Lescanne. On the recursive decomposition ordering with lexicographical status and other related orderings. J. of Automated Reasoning 6 (1) 39-49 (1990). 385
14. R. Nieuwenhuis. Simple LPO constraint solving methods. Inf. Process. Lett. 47(2):65-69, Aug. 1993. 386, 386, 396, 396
15. R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In D. Kapur, editor, Proceedings of 11th Conf. on Automated Deduction, Saratoga Springs, NY, 1992, volume 607 of Lecture Notes in Artificial Intelligence, pages 477-491, June 1992, Springer-Verlag. 385, 386
16. D. Plaisted. A recursively defined ordering for proving termination of term rewriting systems. Technical Report R-78-943, U. of Illinois, Dept of Computer Science, 1978. 385
17. J. Steinbach. Extensions and comparison of simplification orderings. Proceedings of 3rd RTA, Chapel Hill, NC, volume 355 of Lecture Notes in Computer Science, pages 434-448, 1989, Springer-Verlag. 385