Title of article
CancellativeAbelianMonoids and Related Structures in Refutational Theorem Proving (Part II)
Author/Authors
UweWaldmann، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
31
From page
831
To page
861
Abstract
Cancellative superposition is a refutationally complete calculus for first-order equational theorem proving in the presence of the axioms of cancellativeAbelianmonoids, and, optionally, the torsion-freeness axioms. Thanks to strengthened ordering restrictions, cancellative superposition avoids some of the inefficiencies of classical AC-superposition calculi. We show how the efficiency of cancellative superposition can be further improved by using variable elimination techniques, leading to a significant reduction of the number of variable overlaps. In particular, we demonstrate that in divisible torsion-free Abelian groups, variable overlaps, AC-unification and AC-orderings can be avoided completely.
Journal title
Journal of Symbolic Computation
Serial Year
2002
Journal title
Journal of Symbolic Computation
Record number
805638
Link To Document