Logical aspects of several bottom-up fittings

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

Volumn 1501, Issue , 1998, Pages 158-168

  Yamamoto, Akihiro ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; LEARNING SYSTEMS;

BOTTOM UP; CLAUSAL LOGIC; COMPUTATIONAL LEARNING; INVERSE ENTAILMENT; LEARNING METHODS;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 0012489983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49730-7_12     Document Type: Conference Paper

References (21)

1. D. Angluin, M. Frazier, and L. Pitt. Learning Conjunctions of Horn Clauses. Machine Learning, 9:147-164, 1992.
2. H. Arimura. Learning Acyclic First-order Horn Sentences From Implication. In Proceedings of the 8th International Workshop on Algorithmic Learning Theory (LNAI 1316), pages 432-445, 1997.
3. W. Buntine. Generalized Subsumption and its Applications to Induction and Redundancy. Artificial Intelligence, 36:149-176, 1988.
4. W. W. Cohen. PAC-learning Recursive Logic Programs: Efficient Algorithms. J. of Artificial Intelligence Research, 2:501-539, 1995.
5. W. W. Cohen. PAC-learning Recursive Logic Programs: Negative Results. J. of Artificial Intelligence Research, 2:541-573, 1995.
6. B. Jung. On Inverting Generality Relations. In Proceedings of the 3rd International Workshop on Inductive Logic Programming, pages 87-101, 1993.
7. J.-U. Kietz. Inductive Analyse relationaler Daten. PhD thesis, Technische Univer-sitat Berlin, 1996. (in German).
8. J. W. Lloyd. Foundations of Logic Programming: Second, Extended Edition. Springer-Verlag, 1987.
9. S. Muggleton. Inductive Logic Programming. In S. Arikawa and S. Goto and S. Ohsuga and T. Yokomori, editor, Proceedings of the First International Workshop on Algorithmic Learning Theory, pages 42-62. JSAI, 1990.
10. S. Muggleton. Inverse Entailment and Progol. New Generation Computing, 13:245-286, 1995.
11. S. Muggleton. Personal Communication, 1996.
12. S. H. Muggleton and W. Buntine. Machine Invention of First-Order Predicates by Inverting Resolution. In Proceeding of the Fifth International Conference on Machine Learning, pages 339-352. Morgan Kaufmann, 1988.
13. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming (LNAI 1228). Springer, 1997.
14. G. D. Plotkin. Automatic Methods ofInductive Inference. PhD thesis, Edinburgh University, 1971.
15. C. Rouveirol. Completeness for Inductive Procedures. In Proceedings of the 8th International Workshop on Machine Learning, pages 452-456. Morgan Kaufmann, 1991.
16. C. Rouveirol. Extentions of Inversion of Resolution Applied to Theory Completion. In S. Muggleton, editor, Inductive Logic Programming, pages 63-92. Academic Press, 1992.
17. A. Yamamoto. Representing Inductive Inference with SOLD-Resolution. In Proceedings of the IJCAI'97 Workshop on Abduction and Induction in AI, pages 59-63, 1997.
18. A. Yamamoto. Theoretical Foundations of Inductive Logic Programming. The Journal of Japanese Society for Artificial Intelligence, 12(5):665-674, 1997. (In Japanese).
19. A. Yamamoto. Which Hypotheses Can Be Found with Inverse Entailment? In Proceedings of the Seventh International Workshop on Inductive Logic Programming (LNAI 1297), pages 296-308, 1997. The extended abstract is in Proceedings of the IJCAI'97 Workshop on Frontiers of Inductive Logic Programming, pp.19-23 (1997).
20. A. Yamamoto. Revising the Logical Foundations of Inductive Logic Programming Systems with Ground Reduced Programs. To appear in New Generation Computing, 1998.
21. A. Yamamoto. Using Abduction for Induction based on Bottom Generalization. To appear in A. Kakas and P. Flach (eds.) Abductive and Inductive Reasoning: Essays on their Relation and Integration, 1998.