Unnecessary inferences in associative-commutative completion procedures

DOI10.1007/BF02090774zbMATH Open0707.68071OpenAlexW2049670190MaRDI QIDQ3489486FDOQ3489486

Authors: Deepak Kapur, Hantao Zhang 

Publication date: 1990

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02090774

Recommendations

• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Consider only general superpositions in completion procedures
• A general refutational completeness result for an inference procedure based on associative-commutative unification
• Some experiments with a completion theorem prover
• Automated deduction with associative-commutative operators

zbMATH Keywords

superpositionautomated reasoningcompletion procedureJacobson's theorem

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Title not available (Why is that?)
• A Unification Algorithm for Associative-Commutative Functions
• Complete Sets of Reductions for Some Equational Theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Only prime superpositions need be considered in the Knuth-Bendix completion procedure
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structure theory for algebraic algebras of bounded degree
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Complexity of matching problems
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Non-resolution theorem proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Case studies of Z-module reasoning: Proving benchmark theorems from ring theory
• Title not available (Why is that?)

Cited In (5)

• Harald Ganzinger's legacy: contributions to logics and programming
• A path ordering for proving termination of AC rewrite systems
• Some experiments with a completion theorem prover
• Redundancy criteria for constrained completion
• Redundancy criteria for constrained completion

Uses Software

• RRL

This page was built for publication: Unnecessary inferences in associative-commutative completion procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489486)