Which hypotheses can be found with inverse entailment?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1297, Issue , 1997, Pages 296-308

  Yamamoto, Akihiro ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880248934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3540635149_58     Document Type: Conference Paper

References (15)

1. H. Arimura. Learning Acyclic First-order Horn Sentences From Implication. To appear in the Proceedings of the 8th International Workshop on Algorithmic Learning Theory, 1997.
2. W. Buntine. Generalized Subsumption and Its Applications to Induction and Redundancy. Artificial Intelligence, 36:149-176, 1988.
3. W. W. Cohen. Pac-learning Recursive Logic Programs: Efficient Algorithms. J. of Artificial Intelligence Research, 2:501-539, 1995.
4. W. W. Cohen. Pac-learning Recursive Logic Programs: Negative Results. J. of Artificial Intelligence Research, 2:541-573, 1995.
5. K. Furukawa, T. Murakami, K. Ueno, T. Ozaki, and K. Shimazu. On a Sufficient Condition for the Exisitence of Most Specific Hypothesis in Progol. SIG-FAI-9603, 56-61, Resarch Reprot of JSAI, 1997.
6. K. Inoue. Linear Resolution for Consequence Finding. Artificial Intelligence, 56:301-353, 1992.
7. R. A. Kowalski. The Case for Using Equality Axioms in Automatic Demonstration. In Proceedings of the Symposium on Automatic Demonstaration (Lecture Notes in Mathematics 125), pages 112-127. Springer-Verlag, 1970.
8. J. W. Lloyd. Foundations of Logic Programming: Second, Extended Edition. Springer - Verlag, 1987.
9. S. Muggleton. Inverse Entailment and Progol. New Generation Computing, 13:245-286, 1995.
10. S.-H. Nienhuys-Cheng and Ronald de Wolf. The Subsumption Theorem in Inductive Logic Programming: Facts and Fallacies. In L. de Raedt, editor, Proceedings of the 5th International Workshop on Inductive Logic Programming, pages 147-160, 1994.
11. G. D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, 1971.
12. C. Rouveirol. Completeness for Inductive Procedures. In Proceedings of the 8th International Workshop on Machine Learning, pages 452-456. Morgan Kaufmann, 1991.
13. C. Rouveirol. Extentions of Inversion of Resolution Applied to Theory Completion. In S. Muggleton, editor, Inductive Logic Programming, pages 63-92. Academic Press, 1992.
14. A. Yamamoto. Improving Theories for Inductive Logic Programming Systems with Ground Reduced Programs. Submitted to New Generation Computing, 1996.
15. A. Yamamoto. Representing Inductive Inference with SOLD-Resolution. To appear in the Proceedings of the IJCAÏ'97 Workshop on Abduction and Induction in Al, 1997.