论文信息 - Knuth-Bendix completion of theories of commuting group endomorphisms

Knuth-Bendix completion of theories of commuting group endomorphisms

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.

Bernd Löchner | Aaron Stump

[1] Li-Yang Tan,et al. The Algebra of Equality Proofs , 2005, RTA.

[2] Jürgen Giesl,et al. Automated Termination Proofs with AProVE , 2004, RTA.

[3] David L. Dill,et al. Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT , 2002, CAV.

[4] H. Brown,et al. Computational Problems in Abstract Algebra , 1971 .

[5] Jürgen Giesl. Automated Termination Proofs with Measure Functions , 1995, KI.

[6] Albert Oliveras,et al. Proof-Producing Congruence Closure , 2005, RTA.

[7] Enno Ohlebusch,et al. Modular Termination Proofs for Rewriting Using Dependency Pairs , 2002, J. Symb. Comput..

[8] Natarajan Shankar,et al. Justifying Equality , 2005, Electron. Notes Theor. Comput. Sci..

[9] D. Knuth,et al. Simple Word Problems in Universal Algebras , 1983 .

[10] Thomas Hillenbrand,et al. A phytography of WALDMEISTER , 2002, AI Commun..