The theory of total unary RPO is decidable

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 660-672

  Narendran, Paliath ^a   Rusinowitch, Michael ^b  

^a State University of New York   (United States)

^b LORIA   (France)

Author keywords

first order theory; ground re ducibility; ordered rewriting; Recursive path ordering; tree automata

Indexed keywords

FIRST-ORDER THEORIES; GROUND RE-DUCIBILITY; ORDERED REWRITING; RECURSIVE PATH ORDERING; TREE AUTOMATA;

AUTOMATA THEORY; DECISION THEORY; FORESTRY; LOGIC PROGRAMMING; THEOREM PROVING;

COMPUTABILITY AND DECIDABILITY;

EID: 84867803120     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_44     Document Type: Conference Paper

References (21)

1. R. Caferra and N. Peltier. Disinference rules, model building and abd uction. Logic at work: Essays dedicated to the memory of Helena Rasiowa (Part 5: Logic in Computer Science, Chap. 20). Physica-Verlag, 1998.
2. A-C. Caron, J-L. Coquide, and M. Dauchet. Encompassment proper ties and automata with constraints. In C. Kirchner, editor, Proceedings 5th Conference on Rewriting Techniques and Applications, Montreal (Canada), volume 690 of Lecture Notes in Computer Science, pages 328-342. Springer-Verlag, 1993.
3. H. Comon. Solving inequations in term algebras. In Proc. 5th IEEE Symposium on Logic in Computer Science (LICS), Philadelphia, June 1990.
4. H. Comon,M. Dauchet,R. Gilleron F. Jacquemard, D. Lugiez,S. Tison M. Tommasi. Tree Automata Techniques and Applications. http://www.grappa.univ-lille3.fr/tata/
5. H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision prob-lems in ordered rewriting. In Proc. 13th IEEE Symp. Logic in Computer Science (LICS'98), Indianapolis, IN, USA, June 1998, pages 276-286, 1998.
6. H. Comon and R. Treinen. The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science 176, April 1997.
7. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Sci-ence 17(3): 279-301. 1982.
8. J.-P. Jouannaud and M. Okada. Satis-Ability of systems of ordinal notations with the subterm ordering is decidable. In 18th International Colloquium on Automata, La nguages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 455-468, Madrid, Spain, July 1991. Springer-Verlag.
9. D. Kapur, P. Narendran, D. Rosenkrantz and H. Zhang. Su-cient Completeness, Ground-Reducibility and Their Complexity. Acta Informatica 28 (1991) 311-350.
10. D. Kapur, P. Narendran and G. Sivakumar. A path ordering for proving termi-nat ion of term rewriting systems. In H. Ehrig (ed.), 10th CAAP, volume 185 of Lecture Notes in Computer Science, pages 173-187, Berlin, March 1985.
11. D. Kapur and H. Zhang. An Overview of Rewrite Rul e Laboratory (RRL), J. of Computer and Mathematics with Applications, 29, 2, 1995, 91-114.
12. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic con-straints. Revue Franaise d'Intelligence Artificielle, 4(3):9-52, 1990. Special issue on automatic deduction.
13. P. Lescanne. Some properties of the Decomposition Ordering, a simpli-cation ordering to prove termination of rewriting systems. RAIRO, 16(4):331-347, 1982.
14. U. Martin and E. Scott. The order types of termination orderings on monadic terms, strings and multisets. J. Symbolic Logic 62 (1997) 624-635.
15. P. Narendran, M. Rusinowitch and R. Verma. RPO constraint solving is in NP. In: Computer Science Logic (CSL 98), Brno, Czech Republic. August 1998. 12p. LNCS 1584, Springer-Verlag, 1999.
16. W. McCune and R. Padmanabhan. Automated Deduction in Equational Logic and Cubic Curves, Springer-Verlag LNCS 1095 (1996)
17. R. Nieuwenhuis. Simple LPO constraint solving methods. Inf. Process. Lett. 47(2):65-69, Aug. 1993.
18. R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In D. Kapur, editor, Proceedings of 11th Conf. on Automated D eduction, Saratoga Springs, NY, 1992, volume 607 of Lecture Notes in Artificial Intelligence, pages 477-491, June 1992, Springer-Verlag.
19. D. Plaisted. Semantic confluence tests and completion methods. Information and Control, 65:182-215, 1985.
20. J. Steinbach. Extensions and comparison of simpli-cation orderings. Proceedings of 3rd RTA, Chapel Hill, NC, volume 355 of Lecture Notes in Computer Science, pages 434-448, 1989, Springer-Verlag.
21. C. Weidenbach. SPASS: Combining Superposition, Sorts and Splitting in A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, Elsevier, 1999. To appear.