Term rewriting and all that
The CADE-16 ATP System Competition
Journal of Automated Reasoning
Orienting Equalities with the Knuth-Bendix Order
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Things to Know when Implementing KBO
Journal of Automated Reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover
FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The Hydra battle and Cichon’s principle
Applicable Algebra in Engineering, Communication and Computing
Journal of Automated Reasoning
Interpolation and Symbol Elimination
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
An extension of the Knuth-Bendix ordering with LPO-like properties
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and 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
First-Order theorem proving and vampire
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
In this paper we discuss the recently introduced transfinite Knuth-Bendix orders. We prove that any such order with finite subterm coefficients and for a finite signature is equivalent to an order using ordinals below ωω, that is, finite sequences of natural numbers of a fixed length. We show that this result does not hold when subterm coefficients are infinite. However, we prove that in this general case ordinals below ωωω suffice. We also prove that both upper bounds are tight. We briefly discuss the significance of our results for the implementation of firstorder theorem provers and describe relationships between the transfinite Knuth-Bendix orders and existing implementations of extensions of the Knuth-Bendix orders.