Colloque avec actes et comité de lecture. internationale.International audienceWe show how to derive refutationally complete ground superposition calculi systematically from convergent term rewriting systems for equational theories, in order to make automated theorem proving in these theories more effective. In particular we consider abelian groups and commutative rings. These are difficult for automated theorem provers, since their axioms of associativity, commutativity, distributivity and the inverse law can generate many variations of the same equation. For these theories ordering restrictions can be strengthened so that inferences apply only to maximal summands, and superpositions into the inverse law that move summands from one side of...
When rewriting and completion techniques are used for equational theorem proving, the axiom set is s...
International audienceAbduction can be defined as the process of inferring plausible explanations (o...
International audienceThis paper deals with decision procedures specified by using a superposition c...
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 ...
We present a general approach for integrating certain mathematical structures in first-order equatio...
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...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
Article dans revue scientifique avec comité de lecture.We describe the concept of an abstract congru...
AbstractIn the first part of this paper, we introducenormalized rewriting, a new rewrite relation. I...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
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...
When rewriting and completion techniques are used for equational theorem proving, the axiom set is s...
International audienceAbduction can be defined as the process of inferring plausible explanations (o...
International audienceThis paper deals with decision procedures specified by using a superposition c...
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 ...
We present a general approach for integrating certain mathematical structures in first-order equatio...
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...
AbstractCancellative superposition is a refutationally complete calculus for first-order equational ...
Article dans revue scientifique avec comité de lecture.We describe the concept of an abstract congru...
AbstractIn the first part of this paper, we introducenormalized rewriting, a new rewrite relation. I...
AbstractWe define a refutationally complete superposition calculus specialized for abelian groups re...
A new technique is presented for superposition with firstorder clauses with built-in abelian groups ...
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...
When rewriting and completion techniques are used for equational theorem proving, the axiom set is s...
International audienceAbduction can be defined as the process of inferring plausible explanations (o...
International audienceThis paper deals with decision procedures specified by using a superposition c...