AbstractDeduction methods for first-order constrained clauses with equality are described within an abstract framework: constraint strategies, consisting of an inference system, a constraint inheritance strategy and redundancy criteria for clauses and inferences. We give simple conditions for such a constraint strategy to be complete (refutationally and in the sense of Knuth-Bendix-like completion). This allows to prove in a uniform way the completeness of several instantiations of the framework with concrete strategies. For example, strategies in which equality constraints are inherited are basic: no inferences are needed on subterms introduced by unifiers of previous inferences. Ordering constraints reduce the search space by inheriting t...
We propose a new calculus SCL(EQ) for first-order logic with equality thatonly learns non-redundant ...
AbstractThis paper studies completion in the case of equations with constraints consisting of first-...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
AbstractDeduction methods for first-order constrained clauses with equality are described within an ...
We show by means of counter examples that some well-known results on the completeness of deduction m...
We define a formalism of equality constraints and use it to prove the completeness of what we have c...
AbstractThis paper studies completion in the case of equations with constraints consisting of first-...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
First-order logics allows one to quantify over all elements of the universe. However, it is often mo...
Due to scale and complexity of first-order formulas, simplifications play a very important role in f...
We propose a method for proving first order properties of constraint logic programs which manipulate...
We propose a method for proving first order properties of constraint logic programs which manipulate...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
AbstractThe language FT⩽ of ordering constraints over feature trees has been introduced as an extens...
In this paper we give a new abstract framework for the study of Knuth-Bendix type completion procedu...
We propose a new calculus SCL(EQ) for first-order logic with equality thatonly learns non-redundant ...
AbstractThis paper studies completion in the case of equations with constraints consisting of first-...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
AbstractDeduction methods for first-order constrained clauses with equality are described within an ...
We show by means of counter examples that some well-known results on the completeness of deduction m...
We define a formalism of equality constraints and use it to prove the completeness of what we have c...
AbstractThis paper studies completion in the case of equations with constraints consisting of first-...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
First-order logics allows one to quantify over all elements of the universe. However, it is often mo...
Due to scale and complexity of first-order formulas, simplifications play a very important role in f...
We propose a method for proving first order properties of constraint logic programs which manipulate...
We propose a method for proving first order properties of constraint logic programs which manipulate...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
AbstractThe language FT⩽ of ordering constraints over feature trees has been introduced as an extens...
In this paper we give a new abstract framework for the study of Knuth-Bendix type completion procedu...
We propose a new calculus SCL(EQ) for first-order logic with equality thatonly learns non-redundant ...
AbstractThis paper studies completion in the case of equations with constraints consisting of first-...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...