Knuth--Bendix completion of theories of commuting group endomorphisms

Authors:
Aaron Stump;Bernd Löchner
Affiliations:
Computer Science and Engineering, Washington University, St. Louis, MO, USA;FB Informatik, Technische Universität Kaiserslautern, Kaiserslautern, Germany
Venue:
Information Processing Letters
Year:
2006

Citing 6
Cited 3

Modular termination proofs for rewriting using dependency pairs

Journal of Symbolic Computation
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A phytography of WALDMEISTER

AI Communications - CASC
Justifying Equality

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof-producing congruence closure

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The algebra of equality proofs

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Multi-completion with Termination Tools (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Challenges in satisfiability modulo theories

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Slothrop: Knuth-Bendix completion with a modern termination checker

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

Knuth-Bendix completions of the equational theories of k=2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This improves on modern implementations of completion, where the orderings implemented cannot orient the commutation rules. The result has applications in decision procedures for automated verification.