| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428414 | Information Processing Letters | 2006 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
