Decision problems in ordered rewriting

Proceedings - Symposium on Logic in Computer Science

Volumn 1998-June, Issue , 1998, Pages 276-286

  Comon, H ^a   Narendran, P ^b   Nieuwenhuis, R ^c   Rusinowitch, M ^d  

^a CNRS   (France)

^b State University of New York   (United States)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

COMMUTATIVITY; DECISION PROBLEMS; GROUND REDUCIBILITIES; ORDERED REWRITING; ORDERING CONSTRAINTS; REDUCTION ORDERS; TERM REWRITE SYSTEMS;

COMPUTER CIRCUITS;

EID: 27344446334     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.1998.705664     Document Type: Conference Paper

References (24)

1. L. Bachmair. Proof by consistency in equational theories. In Proc. 3rd IEEE Symp. Logic in Com- puter Science, Edinburgh, July 1988.
2. L. Bachmair, N. Dershowitz, and J. Hsiang. Orderings for equational proofs. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass., pages 346-357, June 1986.
3. L. Bachmair, N. Dershowitz. Equational Inference, Canonical Proofs and Proof Orders. Journal of the ACM 41(2), pages 236-267, March 1994.
4. H. Comon, P. Narendran and M. Rusinowitch. Decision Problems in Ordered Rewriting. Research Report 97-R-136, LORIA, Nancy, Nov. 1997. Available on the web at: Www.loria.fr/~rusi/publications.html.
5. H. Comon. Solving inequations in term algebras. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
6. H. Comon and R. Treinen. The first-order theory of lexicographic path orderings is undecidable. Theoretical Computer Science, 176, Apr. 1997.
7. M. Dauchet. Simulation of Turing machines by a left-linear rewrite rule. N. Dershowitz, ed, Rewrit- ing Techniques and Applications, 3rd Int. Conf., LNCS 355, 109-120, 1989.
8. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1):69-115, Feb. 1987.
9. 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.
10. N. Dershowitz, J-P. Jouannaud, and J-W. Klop. More problems in rewriting. In 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, 468-487, Montreal, Canada, 1993.
11. H. Ganzinger, R. Nieuwenhuis, and P. Nivela. The Saturate System, 1995. Software and documentation available: Www.mpi-sb.mpg.de.
12. J. Hsiang and M. Rusinowitch. On word problems in equational theories. In T. Ottmann, editor, 14th International Colloquium on Automata, Languages and Programming, LNCS 267, 54-71, Karlsruhe, Germany, July 1987. Springer-Verlag.
13. J.-P. Jouannaud and E. Kounalis. Automatic proofs by induction in equational theories without constructors. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass., June 1986.
14. D. Kapur and D. Musser. Proof by consistency. Artificial Intelligence, 31(2), Feb. 1987.
15. D. Kapur, P. Narendran, and F. Otto. On ground conuence of term rewriting systems. Inform. Comput., 86(1):14-31, 1989.
16. C. Kirchner, H. Kirchner, and M. Rusinowitch. Deduction with symbolic constraints. Re- vue Francicaise d'Intelligence Arti-cielle, 4(3):9- 52, 1990. Special issue automatic deduction.
17. D.E. Knuth and P.B. Bendix. Simple word problems in universal algebras. In J. Leech, ed., Com- putational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
18. U. Martin and T. Nipkow. Ordered rewriting and conuence. In Mark E. Stickel, editor, 10th In-Ternational Conference on Automated Deduction, LNAI 449, pages 366-380, Kaiserslautern, FRG, July 24-27, 1990. Springer-Verlag.
19. M. Minsky. Computation, Finite and Infinite Ma- chines. Prentice Hall, 1967.
20. R. Nieuwenhuis. Simple LPO constraint solving methods. Inf. Process. Lett., 47(2):65-69, Aug. 1993.
21. P. Nivela and R. Nieuwenhuis. Practical results on the saturation of full first-order clauses: Experiments with the saturate system. (system description). In 5th Int. Conf. on Rewriting Tech- niques and Applications, LNCS 690, Montreal, Canada, 1993. Springer-Verlag.
22. R. Nieuwenhuis and A. Rubio. Theorem Proving with Ordering and Equality Constrained Clauses. J. of Symbolic Computation, 19(4):321-351, April 1995.
23. G. E. Peterson. Complete sets of reductions with constraints. In M. E. Stickel, editor, Proc. 10th Int. Conf. on Automated Deduction, LNAI 449, 381-395. Springer-Verlag, 1990.
24. D. Plaisted. Semantic conuence tests and completion methods. Information and Control, 65:182-215, 1985.