First-order Generalization of the MPMA Belief Update Operator

• Autorzy: Madalińska-Bugaj E. , Łukaszewicz W.
• Języki publikacji: EN

Abstrakty

EN

In this paper we generalize the MPMA belief update operator by admitting first-order knowledge bases and restricted first-order update formulae. This allows us to consider scenarios which cannot be properly formalized either in the originalMPMA or in other existing approaches to belief update.

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2009
• Tom: Vol. 94, nr 1
• Strony: 49--61
• Opis fizyczny: Bibliogr. 16 poz.

Twórcy

autor

Madalińska-Bugaj E.

autor

Łukaszewicz W.

• Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland,

Bibliografia

• [1] G. Boole. An Investigation of the Laws of Thought. London,Walton, 1894. (Reprinted by Dover Books, New York, 1954.
• [2] G. Brewka, J. Hertzberg. How to Do Things with Worlds: on Formalizing Actions and Plans. Journal of Logic and Computation. Vol. 3, No. 5, 517-532, 1993.
• [3] F. M. Brown. Boolean Reasoning. Kluwer Academic Publishers, 1990.
• [4] P. Doherty, W. Łukaszewicz, A. Szałas. Computing Circumscription Revisited. Journal of Automated Reasoning, 18, 1997, 297-336.
• [5] P. Doherty,W.Łukaszewicz, E.Madalińska-Bugaj. The PMA and RelativizingMinimal Change for Action Update. Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, KR-98, 158-169, 1998.
• [6] P. Doherty,W.Łukaszewicz, E.Madalińska-Bugaj. The PMA and RelativizingMinimal Change for Action Update. Fundamenta Informaticae 44(1-2), 95-131, 2000.
• [7] D. Gabbay, H. Olbach. Quantifier Elimination in Second-Order Predicate Logic. South African Computer Journal 7, 1992, 35-43.
• [8] A. Hertzig. The PMA Revisited. Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning, KR'96, Morgan Kaufmann Publishers, Inc. San Francisco, California, 40-50, 1996.
• [9] A. Herzig, O. Rifi. Propositional Belief Base Update and Minimal Change. Artificial Intelligence Journal, 115(1):107-138, 1999.
• [10] H. Katsuno, A. O. Mendelzon. On the Difference between Updating a knowledge base and revising it. In: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, KR'91, Morgan Kaufmann Publishers Inc. San Francisco, California, 1991, 387-395.
• [11] J. Lang. Belief Update revisited. In:Proceedings of the 20th Joint International Conference on Artificial Intelligence, IJCAI'2007,Morgan Kaufmann Publishers Inc., 2517-2522, 2007.
• [12] F. Lin, R. Reiter. Forget It! Presented at the AAAI Fall Symposium on Relevance, New Orleans, Nov. 1994. Electronic version: http://www.cs.ust.hk/ flin/papers.html.
• [13] H. Liu, C. Lutz, M. Milicic, F. Wolter. Updating Description Logic Aboxes. Proceedings Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning, KR-2006, 46-56, 2006.
• [14] M. Winslett. Reasoning about Action Using a Possible Model Approach. In: Proceedings AAAI-88, St. Paul, MN, 89-93, 1988.
• [15] M. Winslett. Updating Logical Databases. Cambridge Tracks in Theoretical Computer Science. Cambridge University Press, 1990.
• [16] M. Winslett. Updating Logical Databases. In: D. Gabbay, A. Galton, J. A. Robinson (eds.). Handbook of Logic in Artificial Intelligence and Logic Programming. Vol. 4 (Epistemic and Temporal Reasoning), Oxford University Press, 133-174, 1995.