Nonmonotonic inductive logic programming

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

Volumn 2173 LNAI, Issue , 2001, Pages 62-80

  Sakama, Chiaki ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BACKGROUND KNOWLEDGE; GENERAL THEORY; INCOMPLETE KNOWLEDGE; INDUCTIVE CONSTRUCTION; NONMONOTONIC; NONMONOTONIC LOGIC;

ARTIFICIAL INTELLIGENCE;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 67649672648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_5     Document Type: Conference Paper

References (43)

1. H. Ade and M. Denecker. AILP: abductive inductive logic programming. In: Proc. 14th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 1201-1207, 1995.
2. M. Bain and S. Muggleton. Non-monotonic learning. In: S. Muggleton (ed.), Inductive Logic Programming, Academic Press, pp. 145-161, 1992.
3. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming 19/20:73-148, 1994.
4. F. Bergadano, D. Gunetti, M. Nicosia, and G. Ruffo. Learning logic programs with negation as failure. In: L. De Raedt (ed.), Advances in Inductive Logic Programming, IOS Press, pp. 107-123, 1996.
5. G. Brewka and J. Dix. Knowledge representation with logic programs. In: Proc. 3rd Workshop on Logic Programming and Knowledge Representation, Lecture Notes in Artificial Intelligence 1471, Springer-Verlag, pp. 1-51, 1997.
6. F. Bry. Intensional updates: abduction via deduction. In: Proc. 7th International Conference on Logic Programming, MIT Press, pp. 561-575, 1990.
7. W. Buntine. Generalized subsumption and its application to induction and redundancy. Artificial Intelligence 36:149-176, 1988.
8. L. De Raedt and M. Bruynooghe. On negation and three-valued logic in interactive concept learning. In: Proc. 9th European Conference on Artificial Intelligence, Pitmann, pp. 207-212, 1990.
9. L. De Raedt and M. Bruynooghe. Belief updating from integrity constraints and queries. Artificial Intelligence 53:291-307, 1992.
10. L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In: Proc. 13th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 1058-1063, 1993.
11. L. De Raedt and N. Lavrač. The many faces of inductive logic programming. In: Proc. 7th International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence 689, Springer-Verlag, pp. 435-449, 1993.
12. Y. Dimopoulos and A. Kakas. Learning nonmonotonic logic programs: learning exceptions. In: Proc. 8th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence 912, Springer-Verlag, pp. 122-137, 1995.
13. Y. Dimopoulos and A. Kakas. Abduction and inductive learning. In: L. De Raedt (ed.), Advances in Inductive Logic Programming, IOS Press/Ohmsha, pp. 144-171, 1996.
14. P. A. Flach and A. C. Kakas (eds). Abduction and Induction: Essays on their Relation and Integration, Applied logic series 18, Kluwer Academic, 2000.
15. P. A. Flach. Logical characterisations of inductive learning. In: D. M. Gabbay and R. Kruse (eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 4, Kluwer Academic Publishers, pp. 155-196, 2000.
16. L. Fogel and G. Zaverucha. Normal programs and multiple predicate learning. In: Proc. 8th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1446, Springer-Verlag, pp. 175-184, 1998.
17. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In: Proc. 5th International Conference and Symposium on Logic Programming, MIT Press, pp. 1070-1080, 1988.
18. N. Helft. Induction as nonmonotonic inference. In: Proc. 1st International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kauf-mann, pp. 149-156, 1989.
19. K. Inoue and Y. Kudoh. Learning extended logic programs. In: Proc. 15th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 176-181, 1997.
20. K. Inoue and H. Haneda. Learning abductive and nonmonotonic logic programs. In: [14], pp. 213-231, 2000.
21. A. C. Kakas and F. Riguzzi. Learning with abduction. In: Proc. 7th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1297, Springer-Verlag, pp. 181-188, 1997.
22. E. Lamma, F. Riguzzi, and L. M. Pereira. Strategies in combined learning via logic programs. Machine Learning 38(1/2), pp. 63-87, 2000.
23. E. Lamma, P. Mello, F. Riguzzi, F. Esposito, S. Ferilli, and G. Semeraro. Cooperation of abduction and induction in logic programming. In: [14], pp. 233-252, 2000.
24. D. Lorenzo and R. P. Otero. Learning to reason about actions. In: Proc. 14th European Conference on Artificial Intelligence, IOS Press, pp. 316-320, 2000.
25. L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In: L. De Raedt (ed.), Advances in Inductive Logic Programming, IOS Press, pp. 219-235, 1996.
26. R. S. Michalski. A theory and methodology of inductive learning. Artificial Intelligence 20:111-161, 1983.
27. T. M. Mitchell. Machine Learning, McGraw-Hill, 1997.
28. S. Muggleton (ed.). Inductive Logic Programming, Academic Press, 1992.
29. S. Muggleton and W. Buntine. Machine invention of first-order predicate by inverting resolution. In: [28], pp. 261-280, 1992.
30. S. Muggleton and L. De Raedt. Inductive logic programming: theory and methods. Journal of Logic Programming 19/20:629-679, 1994.
31. S. Muggleton. Inverse entailment and Progol. New Generation Computing 13:245-286, 1995.
32. A. Nerode, W. Marek, and V. S. Subrahmanian (eds.). Proc. First International Workshop of Logic Programming and Nonmonotonic Reasoning, MIT Press, 1991.
33. S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of inductive logic programming. Lecture Notes in Artificial Intelligence 1228, Springer-Verlag, 1997.
34. G. D. Plotkin. A note on inductive generalization. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 5, Edinburgh University Press, pp. 153-63, 1970.
35. G. D. Plotkin. A further note on inductive generalization. In: B. Meltzer and D. Michie (eds.), Machine Intelligence 6, Edinburgh University Press, pp. 101-124, 1971.
36. T. C. Przymusinski. On the declarative semantics of deductive databases and logic programs. In: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, pp. 193-216, 1988.
37. C. Sakama. Some properties of inverse resolution in normal logic programs. In: Proc. 9th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1634, Springer-Verlag, pp. 279-290, 1999.
38. C. Sakama. Inverse entailment in nonmonotonic logic programs. In: Proc. 10th International Conference on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1866, Springer-Verlag, pp. 209-224, 2000.
39. C. Sakama. Learning by answer sets. In: Proc. AAAI Spring Symposium on Answer Set Programming, AAAI Press, pp. 181-187, 2001.
40. J. Seitzer. Stable ILP: exploring the added expressivity of negation in the background knowledge. In: Proceedings of IJCAI-95 Workshop on Frontiers of ILP, 1997.
41. Y. Shoham. Nonmonotonic logics: meaning and utility. In: Proc. 10th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 388-393, 1987.
42. L. Sterling and E. Shapiro. The Art of Prolog, 2nd Edition, MIT Press, 1994.
43. K. Taylor. Inverse resolution of normal clauses. In: Proc. 3rd International Workshop on Inductive Logic Programming, J. Stefan Institute, pp. 165-177, 1993.