Add to ORKGAn extended abstract of this report has appeared in Rajeev Gore, Alexander Leitsch, and Tobias Nipkow, (eds.), Automated Reasoning, 1. International Joint Conference, IJCAR 2001, Siena (IT), June 18-22, 2001, LNAI 2083, p. 226-241, Springer-Verl.SIGLEAvailable from TIB Hannover: RR 1912(2001-2-001) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids ...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present a calculus for first-order theorem proving in the presence of the axioms of totally orde...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
We define a refutationally complete superposition calculus specialized for abelian groups represen...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
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 ...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving calc...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids ...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...
We present a calculus for first-order theorem proving in the presence of the axioms of totally orde...
We present a calculus for first-order theorem proving in the presence of the axioms of totally order...
We define a refutationally complete superposition calculus specialized for abelian groups represen...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
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 ...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
Variable overlaps are one of the main sources for the inefficiency of AC or ACU theorem proving calc...
In divisible torsion-free abelian groups, the efficiency of the cancellative superposition calculus...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids ...
We present a constraint superposition calculus in which the axioms of cancellative abelian monoids a...