Representation of incomplete knowledge by induction of default theories

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

Volumn 2173 LNAI, Issue , 2001, Pages 160-172

  Nicolas, Pascal ^a   Duval, Béatrice ^a  

^a UNIVERSITÉ D'ANGERS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BACKGROUND KNOWLEDGE; COMPLETE THEORY; COMPLEX DOMAINS; DEFAULT LOGIC; DEFAULT THEORY; INCOMPLETE KNOWLEDGE; LEARNING PROCESS; OPERATIONAL METHODS;

ARTIFICIAL INTELLIGENCE;

KNOWLEDGE REPRESENTATION;

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

References (25)

1. M. Bain and S. Muggleton. Non-monotonic learning. In S. Muggleton, editor, Inductive Logic Programming, pages 145-161. Academic Press, 1992.
2. F. Bergadano, D. Gunetti, M. Nicosia, and G. Ruffo. Learning logic programs with negation as failure. In L. De Raedt, editor, Proceedings of Inductive Logic Programming conference, pages 33-51, K. U. Leuven, 1995.
3. G. Brewka. Adding priorities and specificity to default logic. In L. Pereira and D. Pearce, editors, European Workshop on Logics in Artificial Intelligence (JELIA'94), Lecture Notes in Artificial Intelligence, pages 247-260. Springer Verlag, 1994.
4. P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczyński. Computing with default logic. Artificial Intelligence, 112:105-146, 1999.
5. L. De Raedt and M. Bruynooghe. On negation and three-valued logic in interactive concept learning. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 207-212. Pitman, 1990.
6. L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In R. Bajcsy, editor, Proceedings of the 13th International Joint Conference on Artificial Intelligence, pages 1058-1063. Morgan Kaufmann Publishers, 1993.
7. Y. Dimopoulos, S. Džeroski, and A. Kakas. Integrating explanatory and descriptive learning in ILP. In Proceedings of the International Joint Conference on Artificial Intelligence, volume 2, pages 900-906. Morgan Kaufmann Publishers, 1997.
8. Y. Dimopoulos and A. Kakas. Learning non-monotonic logic programs: Learning exceptions. In N. Lavrač and S. Wrobel, editors, European Coonference on Machine Learning'95, volume 912 of Lecture Notes in Artificial Intelligence, pages 122-137. Springer Verlag, 1995.
9. B. Duval and P. Nicolas. Learning default theories. In S. Parsons A. Hunter, editor, Qualitative and Quantitative Approaches to Reasoning with Uncertainty, volume 1638 of Lecture Notes in Artificial Intelligence. Springer Verlag, 1999.
10. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3-4):363-385, 1991.
11. K. Inoue and Y. Kudoh. Learning Extended Logic Programs. In Proceedings of the International Joint Conference on Artificial Intelligence, volume 1, pages 176-181. Morgan Kaufmann Publishers, 1997.
12. E. Lamma, F. Riguzzi, and L. M. Pereira. Strategies in combined learning via logic programs. Machine Learning, 38(1/2):63-87, January 2000.
13. E. Lamma, F. Riguzzi, and L. M. Pereira. Learning with extended logic programs. In Worshop Learning Programming and non monotonic reasoning. Principles of Knowledge Representation and Reasoning, Trento, 1998.
14. T. Linke and T. Schaub. Alternative foundations for Reiter's default logic. Artificial Intelligence, 124:31-86, 2000.
15. L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 219-235. IOS Press, 1996.
16. S. Muggleton. Inverse entailment and Progol. New generation Computing, 13:245-286, 1995.
17. S. Muggleton. Learning from positive data. In S. Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming, volume 1314 of Lecture Notes in Artificial Intelligence, pages 358-376. Springer-Verlag, 1996.
18. S. Muggleton and L. De Raedt. Inductive Logic programming: Theory and Methods. Journal of Logic Program ming, 19/20:629-679, 1994.
19. P. Nicolas, F. Saubion, and I. Stéphan. Gadel: a genetic algorithm to compute default logic extensions. In Proceedings of the European Conference on Artificial Intelligence, pages 484-488, 2000.
20. P. Nicolas and T. Schaub. The XRay system: An implementation platform for local query-answering in default logics. In Simon Parsons Antony Hunter, editor, Applications of Uncertainty Formalisms, volume 1455 of Lecture Notes in Computer Science, pages 254-378. Springer Verlag, 1998.
21. J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239-266, 1990.
22. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81-132, 1980.
23. R. Reiter and G. Criscuolo. On interacting defaults. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 270-276, 1981.
24. C Sakama. Learning by answer sets. In AAAI Spring Symposium: Answer set programming. 171
25. C Sakama. Inverse entailment in nonmonotonic logic programs. volume 1866 of Lecture Notes in Artificial Intelligence, pages 209-224. Springer-Verlag, 2000.