Abstract
In order to really understand all aspects of logic-based program development of different semantics, it would be useful to have a common solid logical foundation. The stable semantics has one already based on intuitionistic logic I and using the notion of completions. Since S4 expresses I then the stable semantics can be fully represented in S4. We propose the same approach to define extensions of the WFS semantics. We distinguish a particular semantics that we call AS-WFS wich is defined over general propositional theories, can be defined via completions using S4. Interesting AS-WFS seems to satisfy most of the principles of a well behaved semantics. Our general goal is to propose S4 and completions to study the formal behavior of different semantics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
van Dalen, D.: Intuitionistic Logic Handbook of Philosophical Logic. In: Gabbay, D., Guenthner, F. (eds.) Alternatives to Classical Logic, vol. III, D. Reidel Publishing Co., Dordrechtz (1986)
Brewka, G., Dix, J., Konolige, K.: Non Monotonic Reasoning An Overview. Center for the Study of Languages and Information Stanford California (1997)
Arnon, A.: On the Expressive Power of the Three-Valued and FOUR-Valued LanguajesLanguages. Journal of Logic and Computation 9 (1999)
Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 212–226. Springer, Heidelberg (2001)
Dix, J.: A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamental Informaticae XXII 3*, 227–255 (1995)
Dix, J.: A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamental Informaticae XXII 3*, 257–288 (1995)
Dix, J., Osorio, M., Zepeda, C.: A general theory of confluent rewriting systems for logic programming and its applications. Annals of Pure and Applied Logic 108(1-3), 153–188 (2001)
Gelfond, M.: On stratified auto-epistemic theories. In: Proceedings of AAAI 1987, pp. 207–211. Morgan Kaufmann, San Francisco (1987)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programs. In: Proceedings of the Fifth International Conference on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 526–541 (2001)
McDermott, D.: Nonmonotonic Logic II: nonmonotonic Modal Theories. Journal of the Association for Computing Machinery 29(1), 33–57 (1982)
Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)
Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol. 2372, pp. 57–75. Springer, Heidelberg (2002)
Osorio, M., Navarro, J.A., Arrazola, J.: Applications of Intuitionistic Logic in Answer Set Programming. Accepted in Journal of TPLP (2003)
Osorio, M., Navarro, J.A., Arrazola, J.: A Logical Approach to A-prolog. In: 9th. Workshop on Logic Language and Information, Brazil (2002)
Pearce, D.: Stable inference as intuitionistic validity. Logic Programming 38, 79–91 (1999)
Schlipf, J.S.: Formalizing a Logic for Logic Programming. Annals of Mathematics and Artificial Intelligence 5, 279–302 (1992)
van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38, 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osorio, M., Borja, V., Arrazola, J. (2004). Closing the Gap between the Stable Semantics and Extensions of WFS. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds) MICAI 2004: Advances in Artificial Intelligence. MICAI 2004. Lecture Notes in Computer Science(), vol 2972. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24694-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-24694-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21459-5
Online ISBN: 978-3-540-24694-7
eBook Packages: Springer Book Archive