Verifying orientability of rewrite rules using the Knuth-Bendix order

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

Volumn 2051 LNCS, Issue , 2001, Pages 137-153

  Korovin, Konstantin ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; POLYNOMIAL APPROXIMATION;

ALGORITHM FOR SOLVING; DECISION PROBLEMS; KNUTH-BENDIX ORDER; LINEAR INEQUALITIES; ORDERING CONSTRAINTS; ORIENTABILITY; POLYNOMIAL-TIME; REWRITE RULES; ORIENTABLE;

POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

EID: 84888247688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45127-7_12     Document Type: Conference Paper

References (16)

1. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University press, Cambridge, 1998.
2. H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387-411, 1990.
3. H. Comon and R. Treinen. Ordering constraints on trees. In S. Tison, editor, Trees in Algebra and Programming: CAAP'94, volume 787 of Lecture Notes in Computer Science, pages 1-14. Springer Verlag, 1994.
4. N. Dershowitz and D.A. Plaisted. Rewriting. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 9, pages 533-608. Elsevier Science, 2001.
5. D. Detlefs and R. Forgaard. A procedure for automatically proving the termination of a set of rewrite rules. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, First International Conference, RTA-85, volume 202 of Lecture Notes in Computer Science, pages 255-270, Dijon, France, 1985. Springer Verlag.
6. J. Dick, J. Kalmus, and U. Martin. Automating the Knuth-Bendix ordering. Acta Informatica, 28(2):95-119, 1990.
7. D. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, Oxford, 1970.
8. K. Korovin and A. Voronkov. A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering. In Proc. 15th Annual IEEE Symp. on Logic in Computer Science, pages 291-302, Santa Barbara, California, June 2000.
9. K. Korovin and A. Voronkov. Knuth-Bendix constraint solving is NP-complete. Preprint CSPP-8, Department of Computer Science, University of Manchester, November 2000.
10. K. Korovin and A. Voronkov. Verifying orientability of rewrite rules using the knuth-bendix order. Preprint CSPP-11, Department of Computer Science, University of Manchester, March 2001.
11. M.S. Krishnamoorthy and P. Narendran. On recursive path ordering. Theoretical Computer Science, 40:323-328, 1985.
12. P. Lescanne. Term rewriting systems and algebra. In R.E. Shostak, editor, 7th International Conference on Automated Deduction, CADE-7, volume 170 of Lecture Notes in Computer Science, pages 166-174, 1984.
13. U. Martin. How to choose weights in the Knuth-Bendix ordering. In Rewriting Techniques and Applications, volume 256 of Lecture Notes in Computer Science, pages 42-53, 1987.
14. P. Narendran, M. Rusinowitch, and R. Verma. RPO constraint solving is in NP. In G. Gottlob, E. Grandjean, and K. Seyr, editors, Computer Science Logic, 12th International Workshop, CSL'98, volume 1584 of Lecture Notes in Computer Science, pages 385-398. Springer Verlag, 1999.
15. R. Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters, 47:65-69, 1993.
16. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1998.