Add to ORKGEfficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of larger systems (e.g., learning systems). This paper proposes a new theta-subsumption algorithm that is able to return the set of all substitutions by which such a relation holds between two clauses without performing backtracking. Differently from others proposed in the literature, it can be extended to perform resolution, also in theories containing recursive clauses
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
State-of-the-art theta-subsumption engines like Django (C) and Resumer2 (Java) are implemented in im...
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, a...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to b...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to ...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to b...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems axe to b...
Several authors have proposed increasingly efficient methods for computing the least general general...
The subsumption theorem is an important theorem concerning resolution. Es-sentially, it says that if...
Abstract. The subsumption theorem is an important theorem con-cerning resolution. Essentially, it sa...
We present a simple framework for theta-subsumption testing in Prolog. In its simplest instantiatio...
Clause subsumption and rule ordering are long-standing research topics in machine learning (ML). Sin...
We observe, that subsumption of clauses (in the language of first order logic), so far understood a...
Deduction chains represent a syntactic and in a certain sense constructive method for proving comple...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
State-of-the-art theta-subsumption engines like Django (C) and Resumer2 (Java) are implemented in im...
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, a...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to b...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to ...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to b...
Efficiency of the first-order logic proof procedure is a major issue when deduction systems axe to b...
Several authors have proposed increasingly efficient methods for computing the least general general...
The subsumption theorem is an important theorem concerning resolution. Es-sentially, it says that if...
Abstract. The subsumption theorem is an important theorem con-cerning resolution. Essentially, it sa...
We present a simple framework for theta-subsumption testing in Prolog. In its simplest instantiatio...
Clause subsumption and rule ordering are long-standing research topics in machine learning (ML). Sin...
We observe, that subsumption of clauses (in the language of first order logic), so far understood a...
Deduction chains represent a syntactic and in a certain sense constructive method for proving comple...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
A general theory of deduction systems is presented. The theory is illustrated with deduction systems...
State-of-the-art theta-subsumption engines like Django (C) and Resumer2 (Java) are implemented in im...
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, a...