An extension of the Knuth-Bendix ordering with LPO-like properties

Authors:
Michel Ludwig;Uwe Waldmann
Affiliations:
Department of Computer Science, University of Liverpool, Liverpool, United Kingdom;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Year:
2007

Citing 8
Cited 7

Automating the Knuth Bendix ordering

Acta Informatica
Term rewriting and all that

Term rewriting and all that
Theorem Proving for Hierarchic First-Order Theories

Proceedings of the Third International Conference on Algebraic and Logic Programming
S PASS Version 2.0

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Modular proof systems for partial functions with Evans equality

Information and Computation - Special issue: Combining logical systems
Things to Know when Implementing KBO

Journal of Automated Reasoning
The design and implementation of VAMPIRE

AI Communications - CASC
Recursive path orderings can also be incremental

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

MetiTarski: An Automatic Prover for the Elementary Functions

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Interpolation and Symbol Elimination

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions

Journal of Automated Reasoning
On transfinite Knuth-Bendix orders

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Interpolation and symbol elimination in vampire

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Ordinals and knuth-bendix orders

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Unifying the Knuth-Bendix, recursive path and polynomial orders

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible with certain requirements of hierarchic superposition calculi. Moreover, it does not allow non-linear definition equations to be oriented in a natural way. We present an extension of the Knuth-Bendix ordering that makes it possible to overcome these restrictions.