Abstract
We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple and general, making use of two distinct complementary techniques: defaultification and preference. While defaultification resolves potential conflicts by inducing more answer sets, preferences then select among these answer sets, yielding the answer sets generated by those rules that have been added more recently. We examine instances of the framework with respect to various desirable properties; for the most part, these properties are satisfied by instances of our framework. Finally, the proposed framework is also easily implementable by off-the-shelf systems.
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
Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)
Foo, N., Zhang, Y.: Towards generalized rule-based updates. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI’97), vol. 1, pp. 82–88. Morgan Kaufmann, San Francisco (1997)
Przymusinski, T., Turner, H.: Update by means of inference rules. Journal of Logic Programming 30, 125–143 (1997)
Zhang, Y., Foo, N.Y.: Updating logic programs. In: Proceedings of the Thirteenth European Conference on Artificial Intelligence (ECAI’98), pp. 403–407 (1998)
Alferes, J., et al.: Dynamic updates of non-monotonic knowledge bases. Journal of Logic Programming 45, 43–70 (2000)
Alferes, J., et al.: LUPS - A language for updating logic programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 162–176. Springer, Heidelberg (1999)
Inoue, K., Sakama, C.: Updating extended logic programs through abduction. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 147–161. Springer, Heidelberg (1999)
Alferes, J.J., Dell’Acqua, P., Pereira, L.M.: A compilation of updates plus preferences. In: Flesca, S., et al. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 62–73. Springer, Heidelberg (2002)
Eiter, T., et al.: On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming 2, 711–767 (2002)
Zhang, Y., Foo, N.: A unified framework for representing logic program updates. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 707–713. AAAI Press, Menlo Park (2005)
Winslett, M.: Reasoning about action using a possible models approach. In: Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI’88), pp. 89–93. AAAI Press, Menlo Park (1988)
Sadri, F., Kowalski, R.: A theorem-proving approach to database integrity. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 313–362. Morgan Kaufmann, San Francisco (1987)
Nieuwenborgh, D.V., Vermeir, D.: Preferred answer sets for ordered logic programs. Theory and Practice of Logic Programming 6, 107–167 (2006)
Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artificial Intelligence 109, 297–356 (1999)
Delgrande, J., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming 3, 129–187 (2003)
Schaub, T., Wang, K.: A semantic framework for preference handling in answer set programming. Theory and Practice of Logic Programming 3, 569–607 (2003)
Eiter, T., et al.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programming 3, 463–498 (2003)
Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proceedings of the Seventh International Conference on Logic Programming (ICLP’90), pp. 579–597. MIT Press, Cambridge (1990)
Alferes, J.J., et al.: Semantics for dynamic logic programming: A principle-based approach. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 8–20. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Delgrande, J.P., Schaub, T., Tompits, H. (2007). A Preference-Based Framework for Updating Logic Programs. In: Baral, C., Brewka, G., Schlipf, J. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2007. Lecture Notes in Computer Science(), vol 4483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72200-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-72200-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72199-4
Online ISBN: 978-3-540-72200-7
eBook Packages: Computer ScienceComputer Science (R0)