Abstract
We have studied the update operator ⊕ defined in [4] without tautologies and we have observed that satisfies an interesting property. This property is similar to one postulate proposed by AGM but, in this case for nonmonotonic logic and that we called WIS. Also, we consider other five additional basic properties about update programs and we show that ⊕ satisfies them. So, this work continues the analysis about the AGM postulates with respect to operator ⊕ under the refinated view that includes knowledge and beliefs that we began in a recent previous paper and that satisfies the WIS property for closed programs under tautologies.
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.
Similar content being viewed by others
References
Alchourron, C.E., Gardenfors, P., Makinson, D.: On the logic of Theory Change, Partial Meet Functions for Contraction and Revision Functions. Journal of Symbolic Logic 50, 510–530 (1985)
Alferes, J.J., Pereira, L.M.: Logic Programming Updating – a guided approach. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 382–412. Springer, Heidelberg (2002)
Brewka, G., Dix, J., Knonolige, K.: Nonmonotonic Reasoning: An overview. CSLI Publication (ed.) Leland Stanford Junior University (1997)
Eiter, T., Fink, M., Sabattini, G., Thompits, H.: Considerations on Updates of Logic Programs. In: Brewka, G., Moniz Pereira, L., Ojeda-Aciego, M., de Guzmán, I.P. (eds.) JELIA 2000. LNCS (LNAI), vol. 1919, p. 2. Springer, Heidelberg (2000)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programs. In: Proceedings of the Fifth International Conference on Logic Programming 2, pp. 1070–1080. MIT Press, Cambridge
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and Disjunctive databases. New Generation Computing, pp. 365–387 (1991)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artificial Intelligence 52, 263–294 (1991)
Lifschitz, V., Pearce, D., Valverde, A.: Strongly Equivalent Logic Programs. ACM Transactions on Computational Logic 2, 526–541 (2001)
Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming (extended version). 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., Zacarías, F.: Irrelevance of Syntax in updating answer set programs. To appear in Workshop on Logic and Agents into Proc. of Fourth Mexican International Conference on Computer Science (ENC 2003), Apizaco Tlaxcala, México (2003)
Rasiowa, E.: An algebraic approach to non–classical logics. American Elsevier Publishing company, INC., New–York (1974)
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., Zacarías, F. (2004). On Updates of Logic Programs: A Properties-Based Approach. In: Seipel, D., Turull-Torres, J.M. (eds) Foundations of Information and Knowledge Systems. FoIKS 2004. Lecture Notes in Computer Science, vol 2942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24627-5_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-24627-5_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20965-2
Online ISBN: 978-3-540-24627-5
eBook Packages: Springer Book Archive