Abstract
Our purpose is to develop a modular systematic method of representing nonmonotonic reasoning problems with the Well Founded Semantics of extended logic programs augmented with eXplicit negation (WFSX), and augmented by its Contradiction Removal Semantics (CRSX) when needed. We show how to cast in the language of such logic programs forms of non-monotonic reasoning like defeasible reasoning and hypothetical reasoning, and apply them to different domains of knowledge representation, for instance taxonomic hierarchies and reasoning about actions. We then abstract a modular systematic method of representing non-monotonic problems in logic programming.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alferes, J.J., and L.M. Pereira: “On logic program semantics with two kinds of negation,” in: IJCSLP'92. MIT Press, 1992.
Dung, P.M., and P. Ruamviboonsuk: “Well founded reasoning with classical negation,” in: A. Nerode, W. Marek, and V.S. Subrahmanian (eds.), Workshop on LPNMR. MIT Press, 1991.
Gelfond, M., and V. Lifschitz: “The stable model semantics for logic programming,” in: R.A. Kowalski and K.A. Bowen (eds.), 5th ICLP, MIT Press (1988) 1070–1080.
Gelfond, M., and V. Lifschitz: “Logic programs with classical negation,” in: Warren and Szeredi (eds.), ICLP, MIT Press (1990) 579–597.
Hanks, S., and D. McDermott: “Default reasoning, nonmonotonic logics and the frame problem,” in: AAAI86 (1986) 328–333.
Inoue, K.: “Extended logic programs with default assumptions,” in: K. Furukawa (ed.), 8th ICLP, MIT Press (1991) 490–504.
Kautz, H.: “The logic of persistence,” in: AAAI'86 (1986) 401.
Kowalski, R.: “Problems and promises of computational logic,” in: J. Lloyd (ed.), Computational Logic Symposium Springer-Verlag (1990) 1–36.
Kowalski, R., and F. Sadri: “Logic programs with exceptions,” in: Warren and Szeredi (eds.), ICLP, MIT Press (1990) 598–613.
Lifschitz, V.: “Pointwise circumscription,” in: AAAI'86 (1986) 406.
Lloyd, J.W.: Foundations of Logic Programming. Symbolic Computation. Springer-Verlag, 1984.
McCarthy, J., and P.J. Hayes: Some Philosophical Problems from the Standpoint of Artificial Intelligence. Readings in Nonmonotonic Reasoning. M. Kaufmann Inc. (1987) 26–45.
Pereira, L.M., and J.J. Alferes: “Well founded semantics for logic programs with explicit negation,” in: ECAI'92. John Wiley & Sons, Ltd, 1992.
Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Contradiction removal semantics with explicit negation.” In this book.
Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Default theory for well founded semantics with explicit negation,” in: JELIA'92, 1992a.
Pereira, L.M., J.J. Alferes, and J.N. Aparício: “Well founded semantics with explicit negation and default theory,” Technical report, AI Center, Uninova, 1992b. Submitted.
Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Counterfactual reasoning based on revising assumptions,” in: V. Saraswat and K. Ueda (eds.), ILPS, MIT Press (1991a) 566–580.
Pereira, L.M., J.N. Aparício, and J.J. Alferes: “Hypothetical reasoning with well founded semantics,” in: B. Mayoh (ed.) Third Scandinavian Con. on AI. IOS Press, 1991b.
Pereira, L.M., J.N. Aparício, and J.J. Alferes. “Nonmonotonic reasoning with well founded semantics,” in: K. Furukawa (ed.) ICLP91, MIT Press (1991c) 475–489.
Poole, D.L.: “A logical framework for default reasoning,” in: Journal of AI, 36 (1), (1988) 27–47.
Przymusinski, T.: “Extended stable semantics for normal and disjunctive programs,” in: Warren and Szeredi (eds.) ICLP90, MIT Press (1990) 459–477.
Przymusinski, T.C.: “A semantics for disjunctive logic programs,” in: D. Loveland, J. Lobo, and A. Rajasekar (eds.), ILPS Workshop on Disjunctive Logic Programs, 1991.
Shoham, Y.: Reasoning about Change: Time and Change from the Standpoint of Artificial Intelligence. MIT Press, 1988.
VanGelder, A., K.A. Ross, and J.S. Schlipf: “The well-founded semantics for general logic programs,” in: Journal of the ACM (1990) 221–230.
Wagner, G.: “A database needs two kinds of negation,” in: B. Thalheim, J. Demetrovics, and H-D. Gerhardt (eds.), MFDBS'91, Springer-Verlag (1991) 357–371.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pereira, L.M., Aparício, J.N., Alferes, J.J. (1994). Logic programming for non-monotonic reasoning. In: Masuch, M., Pólos, L. (eds) Knowledge Representation and Reasoning Under Uncertainty. Logic at Work 1992. Lecture Notes in Computer Science, vol 808. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58095-6_8
Download citation
DOI: https://doi.org/10.1007/3-540-58095-6_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58095-9
Online ISBN: 978-3-540-48451-6
eBook Packages: Springer Book Archive