AbstractCancellative superposition is a refutationally complete calculus for first-order equational theorem proving in the presence of the axioms of cancellative Abelian monoids, 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
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
Cancellative superposition is a refutationally complete calculus for first-order equational theorem ...
We describe a refined superposition calculus for cancellative abelian monoids. They encompass not on...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the na...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving cal...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving cal...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
Cancellative superposition is a refutationally complete calculus for first-order equational theorem ...
We describe a refined superposition calculus for cancellative abelian monoids. They encompass not on...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the na...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving cal...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving cal...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...