Abstract
We consider two decision problems related to the Knuth-Bendix order (KBO). The first problem is orientability: given a system of rewrite rules R, does there exist some KBO which orients every ground instance of every rewrite rule in R. The second problem is whether a given KBO orients a rewrite rule. This problem can also be reformulated as the problem of solving a single ordering constraint for the KBO. We prove that both problems can be solved in polynomial time. The algorithm builds upon an algorithm for solving systems of homogeneous linear inequalities over integers. Also we show that if a system is orientable using a real-valued KBO, then it is also orientable using an integer-valued KBO.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University press, Cambridge, 1998.
H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387–411, 1990.
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.
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.
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.
J. Dick, J. Kalmus, and U. Martin. Automating the Knuth-Bendix ordering. Acta Informatica, 28(2):95–119, 1990.
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.
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.
K. Korovin and A. Voronkov. Knuth-Bendix constraint solving is NP-complete. Preprint CSPP-8, Department of Computer Science, University of Manchester, November 2000.
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.
M.S. Krishnamoorthy and P. Narendran. On recursive path ordering. Theoretical Computer Science, 40:323–328, 1985.
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.
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.
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.
R. Nieuwenhuis. Simple LPO constraint solving methods. Information Processing Letters, 47:65–69, 1993.
A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korovin, K., Voronkov, A. (2001). Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_12
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive