Minimal Generalizations under OI-Implication

Authors:
Nicola Fanizzi;Stefano Ferilli
Affiliations:
-;-
Venue:
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Year:
2002

Citing 9
Cited 1

Subsumption and implication

Information Processing Letters
Implication of clauses is undecidable

Theoretical Computer Science
Removing redundancy from a clause

Artificial Intelligence
Learning Function-Free Horn Expressions

Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Foundations of Inductive Logic Programming

Foundations of Inductive Logic Programming
Refinement Operators Can Be (Weakly) Perfect

ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
A Generalization Model Based on OI-implication for Ideal Theory Refinement

Fundamenta Informaticae - Intelligent Systems
Generalization of clauses under implication

Journal of Artificial Intelligence Research
OI-implication: soundness and refutation completeness

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2

Spaces of theories with ideal refinement operators

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The adoption of the object identity bias for weakening implication has lead to the definition of OI-implication, a generalization model for clausal spaces. In this paper, we investigate on the generalization hierarchy in the space ordered by OI-implication. The decidability of this relationship and the existence of minimal generalizations in the related search space is demonstrated. These results can be exploited for constructing refinement operators for incremental relational learning.