Information Processing Letters
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Learning from good and bad data
Learning from good and bad data
Implication of clauses is undecidable
Theoretical Computer Science
Removing redundancy from a clause
Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Multistrategy Theory Revision: Induction and Abductionin INTHELEX
Machine Learning - Special issue on multistrategy learning
Reasoning with Logic Programming
Reasoning with Logic Programming
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Refinement Operators Can Be (Weakly) Perfect
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
Undecidability of the Horn-clause implication problem
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Multistrategy Operators for Relational Learning and Their Cooperation
Fundamenta Informaticae
Multistrategy Operators for Relational Learning and Their Cooperation
Fundamenta Informaticae
| Hi-index | 0.00 |
A framework for theory refinement is presented pursuing the efficiency and effectiveness of learning regarded as a search process. A refinement operator satisfying these requirements is formally defined as ideal. Past results have demonstrated the impossibility of specifying ideal operators in search spaces where standard generalization models, like logical implication or &thetas;-subsumption, are adopted. By assuming the object identity bias over a space defined by a clausal language ordered by logical implication, a novel generalization model, named OI-implication, is derived and we prove that ideal operators can be defined for the resulting search space.