Foundations of logic programming
Foundations of logic programming
Information Processing Letters
Implication of clauses is undecidable
Theoretical Computer Science
Computability and logic
Removing redundancy from a clause
Artificial Intelligence
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Equality and Domain Closure in First-Order Databases
Journal of the ACM (JACM)
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
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Ideal Theory Refinement under Object Identity
ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Generalization of clauses under implication
Journal of Artificial Intelligence Research
Cooperation of Multiple Strategies for Automated Learning in Complex Environments
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Minimal Generalizations under OI-Implication
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Spaces of theories with ideal refinement operators
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Weakening implication by assuming the object identity bias allows for both a model-theoretical and a proof-theoretical definition of a novel and more manageable ordering relationship over clausal spaces. In this paper, we give two important results, namely the soundness and the refutation completeness (through a subsumption theorem) of the underlying derivation procedure, that make this relationship particularly appealing for inducing a generalization model for clausal search spaces.