Causes for events: their computation and applications
Proc. of the 8th international conference on Automated deduction
Generalized subsumption and its applications to induction and redundancy
Artificial Intelligence
Induction as nonmonotonic inference
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Abduction versus closure in causal theories
Artificial Intelligence
Linear resolution for consequence finding
Artificial Intelligence
Logical settings for concept-learning
Artificial Intelligence
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Advances in Inductive Logic Programming
Advances in Inductive Logic Programming
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Hypotheses Finding via Residue Hypotheses with the Resolution Principle
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
DS '98 Proceedings of the First International Conference on Discovery Science
ILP '98 Proceedings of the 8th International Workshop on Inductive Logic Programming
Theory Completion Using Inverse Entailment
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
Which Hypotheses Can Be Found with Inverse Entailment?
ILP '97 Proceedings of the 7th International Workshop on Inductive Logic Programming
A completeness theorem and a computer program for finding theorems derivable from given axioms
A completeness theorem and a computer program for finding theorems derivable from given axioms
Query answering in circumscription
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Minimal Answer Computation and SOL
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Possibilistic inductive logic programming
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequence-finding. In comparison with previous work, induction via consequence-finding is sound and complete for finding hypotheses from full clausal theories, and can be used for inducing not only definite clauses but also non-Horn clauses and integrity constraints. We also compare induction and abduction from the viewpoint of consequence-finding, and clarify the relationship and difference between the two.