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 re...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 98; no. 5; pp. 195 - 198
Main Authors Stump, Aaron, Löchner, Bernd
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 15.06.2006
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Automatic theorem proving
Automation
Computer science; control theory; systems
Decision procedures
Exact sciences and technology
Group theory
Group theory and generalizations
Knuth–Bendix completion
Logic and foundations
Mathematical logic, foundations, set theory
Mathematical models
Mathematics
Proof theory and constructive mathematics
Sciences and techniques of general use
Studies
Theoretical computing
Theory
Knuth–Bendix completion
Decision procedures
Automatic theorem proving
Group theory
Knuth Bendix completion
Computer theory
Theorem proving
Ordering
Automatic proving
Verification
Knuth-Bendix completion
Equational theory
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2006.01.009