On Generalization and Subsumption for Ordered Clauses
نویسندگان
چکیده
In this paper, we introduce ordered clauses as defined a sequence of literals, and investigate the properties of generalizations for ordered clauses. Furthermore, we show that the subsumption problem for ordered clauses is NP-complete, as similar as the subsumption problem for ordinal clauses. Hence, the definition that a clause is a set of literals is inessential for the intractability of subsumption problem for clauses.
منابع مشابه
Generalization of Clauses under Implication 2
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملGeneralization of Clauses under Implication
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملLeast Generalizations and Greatest Specializations of Sets of Clauses
The main operations in Inductive Logic Programming (ILP) are generalization and specialization, which only make sense in a generality order. In ILP, the three most important generality orders are subsumption, implication and implication relative to background knowledge. The two languages used most often are languages of clauses and languages of only Horn clauses. This gives a total of six diier...
متن کاملConstructing Reenement Operators by Decomposing Logical Implication
Inductive learning models 14] 17] often use a search space of clauses, ordered by a generalization hierarchy. To nd solutions in the model, search algorithms use diierent generalization and specialization operators. In this article we will decompose the quasi-ordering induced by logical implication into six increasingly weak orderings. The diierence between two successive orderings will be smal...
متن کاملGeneralization under Implication by
The present paper discusses a generalization operator based on the-subsumption ordering between Horn clauses introduced by the author elsewhere. It has been shown that-subsumption is strictly stronger than-subsumption and a local equivalent of generalized subsumption. With some language restrictions it is decidable and possesses some other useful properties. Most importantly it allows deening a...
متن کامل