We present a calculus for first-order theorem proving in the presence of the axioms of totally ordered divisible abelian groups. The calculus extends previous superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way of treating equalities and inequalities between additive terms over, e.g., the rational numbers within a first-order theorem prover
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
An extended abstract of this report has appeared in Rajeev Gore, Alexander Leitsch, and Tobias Nipko...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
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...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids ...
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 develop special superposition calculi for first-order theorem proving in the theories of abelian ...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus ...
An extended abstract of this report has appeared in Rajeev Gore, Alexander Leitsch, and Tobias Nipko...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
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...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids ...
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 develop special superposition calculi for first-order theorem proving in the theories of abelian ...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We propose inference systems based on ordered chaining and a concept of (global) redundancy for clau...