We develop special superposition calculi for first-order theorem proving in the theories of abelian groups, commutative rings, and modules and commutative algebras over fields or over the ring of integers, in order to make automated theorem proving in these theories more effective. The calculi are refutationally complete on arbitrary sets of ground clauses, which in particular may contain additional function symbols. The calculi are derived systematically from a representation of the theory as a convergent term rewriting system. Compared to standard superposition they have stronger ordering restrictions so that inferences are applied only to maximal summands, and they contain macro inference rules that use theory axioms in a goal directed f...
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the na...
Cancellative superposition is a refutationally complete calculus for first-order equational theorem ...
International audienceMany applications of automated deduction require reasoning in first-order logi...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
Colloque avec actes et comité de lecture. internationale.International audienceWe show how to derive...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
We define a refutationally complete superposition calculus specialized for abelian groups represen...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We present a general approach for integrating certain mathematical structures in first-order equatio...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
We describe a refined superposition calculus for cancellative abelian monoids. They encompass not on...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the na...
Cancellative superposition is a refutationally complete calculus for first-order equational theorem ...
International audienceMany applications of automated deduction require reasoning in first-order logi...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
We develop special superposition calculi for first-order theorem proving in the theories of abelian ...
Colloque avec actes et comité de lecture. internationale.International audienceWe show how to derive...
We define a superposition calculus specialized for abelian groups represented as integer modules, an...
We define a refutationally complete superposition calculus specialized for abelian groups represen...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
We present a general approach for integrating certain mathematical structures in first-order equatio...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
We present superposition calculi in which the axioms of cancellative abelian monoids and, optionally...
We describe a refined superposition calculus for cancellative abelian monoids. They encompass not on...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
The hierarchic superposition calculus over a theory T, called SUP(T), enables sound reasoning on the...
Cancellative abelian monoids encompass abelian groups, but also such ubiquitous structures as the na...
Cancellative superposition is a refutationally complete calculus for first-order equational theorem ...
International audienceMany applications of automated deduction require reasoning in first-order logi...