Least Generalization under Relative Implication

Authors:
Svetla Boytcheva
Affiliations:
-
Venue:
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Year:
2000

Citing 4
Cited 0

Foundations of logic programming

Foundations of logic programming
Generalized subsumption and its applications to induction and redundancy

Artificial Intelligence
Foundations of Inductive Logic Programming

Foundations of Inductive Logic Programming
Least generalizations and greatest specializations of sets of clauses

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The main operators in Inductive Logic Programming (ILP) are specialization and generalization. In ILP, the three most important generality orders are subsumption, implication and implication relative to background knowledge. The present paper discusses the existence of least generalization under implication relative to background knowledge. It has been shown that the least generalization under relative implication does not exists in the general case, but, as argued in this paper, it exists if the sets to be generalized and the background knowledge satisfy some special conditions.