Abstract
Recently, belief change within the framework of fragments of propositional logic has gained attention. Previous works focused on belief revision, belief merging, and on belief contraction in the Horn fragment. The problem of belief update within the framework of fragments of propositional logic has been neglected so far. In the same spirit as a previous extension of belief revision to propositional fragments, we propose a general approach to define new update operators derived from existing ones such that the result of update remains in the fragment under consideration. Our approach is not limited to the Horn fragment but applicable to many fragments of propositional logic, like Horn, Krom and affine fragments. We study the logical properties of the proposed operators in terms of the KM’s postulates satisfaction and highlight differences between revision and update in this context.
This work has received support from the French Agence Nationale de la Recherche, ASPIQ project reference ANR-12-BS02-0003.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Note that in this example, revision and update do not coincide.
- 2.
There exist update operators that are well-adapted for any characterisable fragment, i.e. that provide a result in the fragment, for instance Hegner’s operator and more generally dependence based update operators [18].
References
Alchourrón, C.E., Gärdenfors, P., Makinson, D.: On the logic of theory change: partial meet contraction and revision functions. J. Symb. Log. 50, 510–530 (1985)
Booth, R., Meyer, T.A., Varzinczak, I.J., Wassermann, R.: On the link between partial meet, kernel, and infra contraction and its application to Horn logic. J. Artif. Intell. Res. (JAIR) 42, 31–53 (2011)
Boutilier, C.: A unified model of qualitative belief change: a dynamical systems perspective. Artif. Intell. 98(1–2), 281–316 (1998)
Cadoli, M., Scarcello, F.: Semantical and computational aspects of Horn approximations. Artif. Intell. 119(1–2), 1–17 (2000)
Creignou, N., Papini, O., Pichler, R., Woltran, S.: Belief revision within fragments of propositional logic. J. Comput. Syst. Sci. 80(2), 427–449 (2014)
Dalal, M.: Investigations into theory of knowledge base revision. In: Proceedings of AAAI, St. Paul, Minnesota, pp 449–479 (1988)
del Val, A., Shoham, Y.: A unified view of belief revision and update. J. Log. Comput. 4(5), 797–810 (1994)
Delgrande, J.P., Jin, Y., Pelletier, F.J.: Compositional belief update. CoRR, abs/1401.3431 (2014)
Delgrande, J.P., Peppas, P.: Belief revision in Horn theories. Artif. Intell. 218, 1–22 (2015)
Delgrande, J.P., Wassermann, R.: Horn clause contraction functions. J. Artif. Intell. Res. (JAIR) 48, 475–511 (2013)
Doherty, P., Lukaszewicz, W., Madalinska-Bugaj, E.: The pma and relativizing minimal change for action update. Fundam. Inform. 44(1–2), 95–131 (2000)
Dubois, D., Prade, H.: Belief revision and updates in numerical formalisms: an overview, with new results for the possibilistic framework. In: Proceedings of IJCAI, pp. 620–625 (1993)
Eiter, T., Gottlob, G.: On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artif. Intell. 57(2–3), 227–270 (1992)
Fagin, R., Ullman, J.D., Vardi, M.Y.: On the semantics of updates in databases. In: The second ACM SIGACT SIGMOD, pp. 352–365 (1983)
Forbus, K.D.: Introducing actions into qualitative simulation. In: Proceedings of IJCAI, pp. 1273–1278 (1989)
Friedman, N., Halpern, J.Y.: Modeling belief in dynamic systems, part II: revision and update. J. Artif. Intell. Res. (JAIR) 10, 117–167 (1999)
Haret, A.: Merging in the Horn fragment. Master’s thesis, TU Wien (2014)
Herzig, A., Rifi, O.: Propositional belief base update and minimal change. Artif. Intell. 115(1), 107–138 (1999)
Horn, A.: On sentences which are true of direct unions of algebras. J. Symb. Log. 16, 14–21 (1951)
Katsuno, H., Mendelzon, A.O.: Propositional knowledge base revision and minimal change. Artif. Intell. 52(3), 263–294 (1991)
Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In: Gärdenfors, P. (ed.) Belief Revision, pp. 183–203. Cambridge University Press, Cambridge (1992)
Keller, A.M., Winslett, M.: On the use of an extended relational model to handle changing incomplete information. IEEE Trans. Softw. Eng. 11(7), 620–633 (1985)
Lang, J.: Belief update revisited. In: Proceedings of IJCAI, pp. 2517–2522 (2007)
Liberatore, P., Schaerf, M.: Belief revision and update: complexity of model checking. J. Comput. Syst. Sci. 62(1), 43–72 (2001)
Van De Putte, F.: Prime implicates and relevant belief revision. J. Log. Comput. 23(1), 109–119 (2013)
Satoh, K.: Nonmonotonic reasoning by minimal belief revision. In: Proceedings of FGCS, Tokyo, pp. 455–462 (1988)
Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of STOC, pp. 216–226 (1978)
Winslett, M.: Reasoning about action using a possible models approach. In: Proceedings of AAAI, pp. 89–93 (1988)
Zhang, Y., Foo, N.Y.: Updates with disjunctive information: from syntactical and semantical perspectives. Comput. Intell. 16(1), 29–52 (2000)
Zhuang, Z.Q., Pagnucco, M.: Entrenchment-based Horn contraction. J. Artif. Intell. Res. (JAIR) 51, 227–254 (2014)
Zhuang, Z.Q., Pagnucco, M., Zhang, Y.: Definability of Horn revision from Horn contraction. In: Proceedings of IJCAI (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Creignou, N., Ktari, R., Papini, O. (2015). Belief Update Within Propositional Fragments. In: Destercke, S., Denoeux, T. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2015. Lecture Notes in Computer Science(), vol 9161. Springer, Cham. https://doi.org/10.1007/978-3-319-20807-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-20807-7_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20806-0
Online ISBN: 978-3-319-20807-7
eBook Packages: Computer ScienceComputer Science (R0)