Least Generalizations under Implication
نویسندگان
چکیده
One of the most prominent approaches in Inductive Logic Programming is the use of least generalizations under subsumption of given clauses. However, subsumption is weaker than logical implication, and not very well suited for handling recursive clauses. Therefore an important open question in this area concerns the existence of least generalizations under implication (LGIs). Our main new result in this paper is the existence and computability of such an LGI for any nite set of clauses which contains at least one non-tautologous function-free clause. We can also deene implication relative to background knowledge. In this case, least generalizations only exist in a very limited case.
منابع مشابه
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 ...
متن کامل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 ...
متن کامل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...
متن کاملGeneralization of Clauses Containing Cross Connections
In the area of inductive learning, generalization is the main operation, and the usual definition of induction is based on logical implication. Plotkin's well-known technique for computing least general generalizations of clauses under θ-subsumption sometimes produces results which are too general with respect to implication. Muggleton has shown that this problem only occurs in one type of gene...
متن کاملCongruence Kernels of Orthoimplication Algebras
Abstracting from certain properties of the implication operation in Boolean algebras leads to so-called orthoimplication algebras. These are in a natural one-to-one correspondence with families of compatible orthomodular lattices. It is proved that congruence kernels of orthoimplication algebras are in a natural one-to-one correspondence with families of compatible p-filters on the correspondin...
متن کامل