Information Processing Letters
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Logic programming and databases
Logic programming and databases
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Ideal Theory Refinement under Object Identity
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Locally Finite, Proper and Complete Operators for Refining Datalog Programs
ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
| Hi-index | 0.01 |
We present a framework for theory refinement operators fulfilling properties that ensure the efficiency and effectiveness of the learning process. A refinement operator satisfying these requirements is defined ideal. Past results have demonstrated the impossibility of defining ideal operators in search spaces ordered by the logical implication or the θ-subsumption relationships. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, we obtain OI-implication, a novel ordering relationship, and show that ideal operators can be defined for the resulting search space.