Induction from answer sets in nonmonotonic logic programs

ACM Transactions on Computational Logic

Volumn 6, Issue 2, 2005, Pages 203-231

  Sakama, Chiaki ^a  

^a WAKAYAMA UNIVERSITY   (Japan)

Author keywords

Answer sets; Induction; Nonmonotonic logic programs

Indexed keywords

ANSWER SETS; INDUCTION; INDUCTIVE NONLINEAR PROGRAMMING (ILP); NONMONOTONIC LOGIC PROGRAMS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; DATA MINING; FORMAL LOGIC; INFORMATION ANALYSIS; LEARNING SYSTEMS; MATHEMATICAL MODELS; SEMANTICS; SYNTACTICS;

LOGIC PROGRAMMING;

EID: 16644384918     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1055686.1055687     Document Type: Article

References (45)

1. BAIN, M. AND MUGGLETON, S. 1992. Non-monotonic learning. In Inductive Logic Programming, S. Muggleton, Ed. Academic Press, Orlando, Fla., 145-161.
2. BARAL, G. AND GELFOND, M. 1994. Logic programming and knowledge representation. J. Logic Prog. 19/20, 73-148.
3. BERGADANO, F., GUNETTI, D., NICOSIA, M., AND RUFFO, G. 1996. Learning logic programs with negation as failure. In Advances in Inductive Logic Programming, L. De. Raedt, Ed. IOS Press, 107-123.
4. BREWKA, G. AND DLX, J. 1997. Knowledge representation with logic programs. In Proceedings of the 3rd Workshop on Logic Programming and Knowledge Representation. Lecture Notes in Artificial Intelligence, vol. 1471. Springer-Verlag, New York, 1-51.
5. CAI, Y., CERCONE, N., AND HAN, J. 1991. Attribute-oriented induction in relational databases. In Knowledge Discovery in Databases, G. P.-Shapiro and W. J. Frawley, Eds. AAAI Press, 213-228.
6. DE RAEDT, L. AND BRUYNOOGHE, M. 1990. On negation and three-valued logic in interactive concept learning. In Proceedings of the 9th European Conference on Artificial Intelligence. Pitman, 207-212.
7. DE RAEDT, L. AND BRUYNOOGHE, M. 1993. A theory of clausal discovery. In Proceedings of the 13th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Francisco, Calif., 1058-1063.
8. DE RAEDT, L. AND LAVRAČ, N. 1993. The many faces of inductive logic programming. In Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems. Lecture Notes in Artificial Intelligence, vol. 689. Springer-Verlag, New York, 435-449.
9. DIMOPOULOS, Y. AND KAKAS, A. 1995. Learning nonmonotonic logic programs: learning exceptions. In Proceedings of the 8th European Conference on Machine Learning. Lecture Notes in Artificial Intelligence, vol. 912. Springer-Verlag, New York, 122-137.
10. EITER, T., FABER, W., LEONE, N., AND PFEIFER, G. 1999. The diagnosis frontend of the dlv system. AI Commun. 12, 99-111.
11. FLACH, P. A. 2000. Logical characterisations of inductive learning. In Handbook of Defeasible Reasoning and Uncertainty Management Systems, D. M. Gabbay and R. Kruse, Eds., Vol. 4. Kluwer Academic Publishers, 155-196.
12. FOGEL, L. AND ZAVERUCHA, G. 1998. Normal programs and multiple predicate learning. In Proceedings of the 8th International Workshop on Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1446. Springer-Verlag, New York, 175-184.
13. GABBAY, D., GILLIES, D., HUNTER, A., MUGGLETON, S., NG, Y., AND RICHARDS, B. 1992. The rule-based systems project: using confirmation theory and non-monotonic logics for incremental learning. In Inductive Logic Programming, S. Muggleton, Ed. Academic Press, Orlando, Fla., 213-230.
14. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming. MIT Press, Cambridge, Mass., 1070-1080.
15. GELFOND, M. AND LIFSCHITZ, V. 1990. Logic programs with classical negation. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, Cambridge, Mass., 579-597.
16. HELFT, N. 1989. Induction as nonmonotonic inference. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning. Morgan Kaufmann, San Francisco, Calif., 149-156.
17. INOUE, K. AND KUDOH, Y. 1997. Learning extended logic programs. In Proceedings of the 15th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Francisco, Calif., 176-181.
18. INOUE, K. AND SAKAMA, C. 1996. A fixpoint characterization of abductive logic programs. J. Logic Prog. 27, 2, 107-136.
19. KAKAS, A. C., KOWALSKI, R. A., AND TONI, F. 1998. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. M. Gabbay, C. J. Hogger, and J. A. Robinson, Eds. Vol. 5. Oxford University Press, 235-324.
20. KAKAS, A. C. AND MANCARELLA, P. 1990. Generalized stable models: a semantics for abduction. In Proceedings of the 9th European Conference on Artificial Intelligence. Pitman, 385-391.
21. LAMMA, E., RIGUZZI, F., AND PEREIRA, L. M. 2000. Strategies in combined learning via logic programs. Mach. Learn. 38, 1/2, 63-87.
22. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Artif. Intel. 138, 39-54.
23. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm - A 25 Year Perspective, K. R. Apt, et al., Ed. Springer-Verlag, New York, 375-398.
24. MARTIN, L. AND VRAIN, C. 1996. A three-valued framework for the induction of general logic programs. In Advances in Inductive Logic Programming, L. De. Raedt, Ed. IOS Press, 219-235.
25. MUGGLETON, S., Ed. 1992. Inductive Logic Programming. Academic Press, Orlando, Fla.
26. MUGGLETON, S. 1995. Inverse entailment and progol. New Gen. Comput. 13, 245-286.
27. MUGGLETON, S. 1998. Completing inverse entailment. In Proceedings of the 8th International Workshop on Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1446. Springer-Verlag, New York, 245-249.
28. MUGGLETON, S. AND BUNTINE, W. 1992. Machine invention of first-order predicate by inverting resolution. In Inductive Logic Programming, S. Muggleton, Ed. Academic Press, Orlando, Fla., 261-280.
29. MUGGLETON, S. AND DE RAEDT, L. 1994. Inductive logic programming: theory and methods. J. Logic Prog. 19/20, 629-679.
30. NICOLAS, P. AND DUVAL, B. 2001. Representation of incomplete knowledge by induction of default theories. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence, vol. 2173. Springer-Verlag, New York, 160-172.
31. NIEMELA, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intel. 25, 241-273.
32. NIENHUYS-CHENG, S.-H. AND DE WOLF, R. 1997. Foundations of Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1228. Springer-Verlag, New York.
33. OTERO, R. P. 2001. Induction of stable models. In Proceedings of the 11th International Conference on Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 2157. Springer-Verlag, New York, 193-205.
34. PRZYMUSINSKI, T. C. 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan-Kaufmann, San Francisco, Calif., 193-216.
35. QUINLAN, J. R. 1990. Learning logical definitions from relations. Mach. Learn. 5, 239-266.
36. REITER, R. 1980. A logic for default reasoning. Artif. Intel. 13, 81-132.
37. RICHARDS, B. L. AND MOONEY, R. J. 1995. Automated refinement of first-order Horn-clause domain theories. Mach. Learn. 19, 2, 95-131.
38. SAKAMA, C. 1999. Some properties of inverse resolution in normal logic programs. In Proceedings of the 9th International Workshop on Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1634. Springer-Verlag, New York, 279-290.
39. SAKAMA, C. 2000. Inverse entailment in nonmonotonic logic programs. In Proceedings of the 10th International Conference on Inductive Logic Programming. Lecture Notes in Artificial Intelligence, vol. 1866. Springer-Verlag, New York, 209-224.
40. SAKAMA, C. 2001. Nonmonotonic inductive logic programming. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence, vol. 2173. Springer-Verlag, New York, 62-80.
41. SAKAMA, C. 2001a. Learning by answer sets. In Proceedings of the AAAI Spring Symposium on Answer Set Programming. AAAI Press, 181-187.
42. SAKAMA, C. AND INOUE, K. 1999. Updating extended logic programs through abduction. In Proceedings of the 5th International Conference Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence, vol. 1730. Springer-Verlag, New York, 147-161.
43. SCHLIPF, J. S. 1995. Complexity and undecidability results for logic programming. Ann. Math. Artif. Intel. 15, 257-288.
44. SEITZER, J. 1997. Stable ILP: Exploring the added expressivity of negation in the background knowledge. In Proceedings of IJCAI-97 Workshop on Frontiers of ILP.
45. SHOHAM, Y. 1987. Nonmonotonic logics: meaning and utility. In Proceedings of the 10th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, San Francisco, Calif., 388-393.