AbstractIn this paper we propose a slight modification of the Knuth and Bendix completion procedure for solving the equality problem in nonequational theories defined by a set of Horn clauses. We prove that the completeness property of this procedure is then preserved, provided that a weak axiomatization of boolean calculus and equality has been given to the procedure. In particular, we need only the reflexivity axiom for equality.Another application of the Knuth and Bendix procedure is the proof by induction (Musser, 1980; Huet-Hullot, 1982 and others). We show that our version of the completion procedure can be used for proving universally quantified formulas (not only equations) in the initial model defined by a set of Horn clauses.Exper...
AbstractFor each consistent universal first order theory T a Boolean valued model of T is constructe...
AbstractOne method of proving theorems in Horn clause theories is surface deduction (also known as t...
We present various refutationally complete calculi for first-order clauses with equality that allow ...
AbstractIn this paper we propose a slight modification of the Knuth and Bendix completion procedure ...
We present a new unfailing completion procedure for Horn clauses with equality, including goal claus...
Abstract. We present a new transformation method by which a given Horn theory is transformed in such...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
AbstractIn this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior...
AbstractWe interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions s...
We present refutationally complete calculi for first-order clauses with equality. General paramodula...
We introduce the equality elimination method which is a new procedure for dealing with Horn clause l...
We define a formalism of equality constraints and use it to prove the completeness of what we have c...
We have previously shown that strict superposition together with merging paramodulation is refutatio...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
We make use of the algebraic theory that has been used to study the complexity of constraint satisf...
AbstractFor each consistent universal first order theory T a Boolean valued model of T is constructe...
AbstractOne method of proving theorems in Horn clause theories is surface deduction (also known as t...
We present various refutationally complete calculi for first-order clauses with equality that allow ...
AbstractIn this paper we propose a slight modification of the Knuth and Bendix completion procedure ...
We present a new unfailing completion procedure for Horn clauses with equality, including goal claus...
Abstract. We present a new transformation method by which a given Horn theory is transformed in such...
AbstractWe present a refutationally complete set of inference rules for first-order logic with equal...
AbstractIn this paper, quantified Horn formulas (QHORN) are investigated. We prove that the behavior...
AbstractWe interpret Horn clauses as conditional rewrite rules. Then we give sufficient conditions s...
We present refutationally complete calculi for first-order clauses with equality. General paramodula...
We introduce the equality elimination method which is a new procedure for dealing with Horn clause l...
We define a formalism of equality constraints and use it to prove the completeness of what we have c...
We have previously shown that strict superposition together with merging paramodulation is refutatio...
We present a framework for the integration of the Knuth-Bendix completion algorithm with narrowing m...
We make use of the algebraic theory that has been used to study the complexity of constraint satisf...
AbstractFor each consistent universal first order theory T a Boolean valued model of T is constructe...
AbstractOne method of proving theorems in Horn clause theories is surface deduction (also known as t...
We present various refutationally complete calculi for first-order clauses with equality that allow ...