Induction of Stable Models
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models semantics. A logic program in this non-monotonic semantics can be contradictory or can have one or several models. We provide a complete characterization on the hypotheses solution to induction of this kind of programs.
Unable to display preview. Download preview PDF.
- 1.M. Bain and S. Muggleton. Nonmonotonic learning. In S. Muggleton, editor, Inductive Logic Programming, pages 145–161. Academic Press, 1992.Google Scholar
- 2.Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Logic Programming: Proc. of the Fifth Int’l Conf. and Symp., pages 1070–1080, 1988.Google Scholar
- 3.W. Marek and M. Truszczynski. Nonmonotonic Logic-Context-Dependent Reasoning. Series Artificial Intelligence, Springer-Verlag, 1993.Google Scholar
- 5.S. Muggleton. Completing inverse entailment. In Proc. of the 8th International Workshop on Inductive Logic Programming, ILP 98, LNAI 1446, pages 245–249, 1998.Google Scholar
- 6.Ilkka Niemelä and Patrick Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 97, LNAI 1265, pages 420–429, 1997.Google Scholar
- 7.C. Sakama. Some properties of inverse resolution in normal logic programs. In Proc. of the 9th International Workshop on Inductive Logic Programming, ILP 99, LNAI 1634, pages 279–290, 1999.Google Scholar
- 8.C. Sakama. Inverse entailment in nonmonotonic logic programs. In Proc. of the 10th International Conference on Inductive Logic Programming, ILP 00, LNAI 1866, pages 209–224, 2000.Google Scholar