Abstract
We argue that under the stable model semantics default negation can be read as explicit negation with update. We show that dynamic logic programming which is based on default negation, even in the heads, can be interpreted in a variant of updates with explicit negation only. As corollaries, we get an easy description of default negation in generalized and normal logic programming where initially negated literals are updated. These results are discussed with respect to the understanding of negation in logic.
Publisher
Institute of Philosophy, Russian Academy of Sciences
Reference40 articles.
1. Alferes et al., 2000 – Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H. and Przymusinski, T.C. “Dynamic Updates of Non-Monotonic Knowledge Bases”, The Journal of Logic Programming, 2000, Vol. 45, No. 1–2, pp. 43–70.
2. Banti et al., 2004 – Banti, F., Alferes, J.J. and Brogi, A. “Well Founded Semantics for Logic Program Updates”, in: Advances in Artificial Intelligence – IBERAMIA 2004, Volume 3315 of Lecture Notes in Computer Science, ed. by Chr. Lema1tre, C.A. Reyes, and J.A. Gonz´alez. Springer, 2004, pp. 397–407.
3. Bidoit and Froidevaux, 1991 – Bidoit, N., and Froidevaux, C. “General logic databases and programs: Default logic semantics and stratification”, Information and Computation, 1991, Vol. 91, No. 1, pp. 15–54.
4. Buccafurri et al., 1999 – Buccafurri, F., Faber, W. and Leone, N. “Disjunctive Logic Programs with Inheritance”, in: Proceedings of the 1999 International Conference on Logic Programming (ICLP-99), ed. by D. De Schreye. Cambridge: MIT Press, 1999, pp. 79–93.
5. Clark, 1978 – Clark, K.L. “Negation as failure”, in: Logic and Data Bases, ed. by H. Gallaire and J. Minker. Plenum, 1978, pp. 293–322.