Abstract
AGM’s belief revision is one of the main paradigms in the study of belief change operations. In this context, belief bases (prioritised bases) have been primarily used to specify the agent’s belief state. While the connection of iterated AGM-like operations and their encoding in dynamic epistemic logics have been studied before, few works considered how well-known postulates from iterated belief revision theory can be characterised by means of belief bases and their counterpart in dynamic epistemic logic. Particularly, it has been shown that some postulates can be characterised through transformations in priority graphs, while others may not be represented that way. This work investigates changes in the semantics of Dynamic Preference Logic that give rise to an appropriate syntactic representation for its models that allow us to represent and reason about iterated belief base change in this logic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The authors consider only linear models in their work and, a priori, it is not clear whether their modal equivalence result can be extended to pre-orders in general. Nevertheless, it indicates that conditionally-grounded models preserve a great deal of conditional information held in general preference models and, as such, constitute an interesting subclass of models to be studied for this logic. Our results in this work only support this conclusion by showing that, for considering this subclass of models, we can obtain interesting representation results that allow computational exploration of DPL in diverse areas.
- 2.
As helpfully pointed out by one of the reviewers, since our agents are introspective in the sense that agents know about their beliefs, the belief change operations investigated in this work do change the agent’s knowledge, but only in the sense that they change their knowledge about their epistemic state, not their knowledge about the world or current state of affairs. This is an important distinction in the class of operations studied.
- 3.
Other interesting examples have been previously provided by Souza et al. [31], showing that some iterated contraction operators cannot be characterised by P-graphs transformations, unless when restricted to a special class of preference models, which they call broad models.
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(2), 510–530 (1985)
Andersen, M.B., Bolander, T., van Ditmarsch, H., Jensen, M.H.: Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief. Synthese 194(7), 2447–2487 (2017)
Andréka, H., Ryan, M., Schobbens, P.Y.: Operators and laws for combining preference relations. J. Log. Comput. 12(1), 13–53 (2002)
Areces, C., Fervari, R., Hoffmann, G.: Relation-changing modal operators. Log. J. IGPL 23(4), 601–627 (2015)
Baltag, A., Smets, S.: A qualitative theory of dynamic interactive belief revision. Texts Log. Games 3, 9–58 (2008)
Boutilier, C.: Revision sequences and nested conditionals. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, vol. 93, pp. 519–531. Morgan Kaufmann, New York (1993)
Casini, G., Fermé, E., Meyer, T., Varzinczak, I.: A semantic perspective on belief change in a preferential non-monotonic framework. In: Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (2018)
Darwiche, A., Pearl, J.: On the logic of iterated belief revision. Artif. Intell. 89(1), 1–29 (1997)
Fermé, E., Garapa, M., Reis, M.D.L.: On ensconcement and contraction. J. Log. Comput. 27(7), 2011–2042 (2017)
Fermé, E., Krevneris, M., Reis, M.: An axiomatic characterization of ensconcement-based contraction. J. Symb. Log. 18(5), 739–753 (2008)
Freund, M., Lehmann, D.: Belief revision and rational inference. Technical report 94–16, Leibniz Center for Research in Computer Science, Institute of Computer Science, Hebrew University of Jerusalem (1994)
Gärdenfors, P., Makinson, D.: Revisions of knowledge systems using epistemic entrenchment. In: Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning About Knowledge, pp. 83–95. Morgan Kaufmann Publishers Inc. (1988)
Georgatos, K.: To preference via entrenchment. Ann. Pure Appl. Log. 96(1–3), 141–155 (1999)
Girard, P.: Modal logic for belief and preference change. Ph.D. thesis, Stanford University (2008)
Girard, P., Rott, H.: Belief revision and dynamic logic. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics. OCL, vol. 5, pp. 203–233. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-06025-5_8
Grove, A.: Two modelings for theory change. J. Philos. Log. 17(2), 157–170 (1988)
Hansson, S.O.: In defense of base contraction. Synthese 91(3), 239–245 (1992)
Hansson, S.O.: Kernel contraction. J. Symb. Log. 59(3), 845–859 (1994)
Jin, Y., Thielscher, M.: Iterated belief revision, revised. Arti. Intell. 171(1), 1–18 (2007)
Levesque, H.J.: A logic of implicit and explicit belief. In: Proceedings of the Fourth National Conference on Artificial Intelligence, pp. 198–202. AAAI Press, Palo Alto, US (1984)
Lewis, D.: Counterfactuals. Wiley, Hoboken (2013)
Lindström, S., Rabinowicz, W.: DDL unlimited: dynamic doxastic logic for introspective agents. Erkenntnis 50(2), 353–385 (1999)
Liu, F.: Reasoning About Preference Dynamics, vol. 354. Springer, New York (2011). https://doi.org/10.1007/978-94-007-1344-4
Lorini, E.: In praise of belief bases: doing epistemic logic without possible worlds. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)
Nayak, A.C., Pagnucco, M., Peppas, P.: Dynamic belief revision operators. Artif. Intell. 146(2), 193–228 (2003)
Ramachandran, R., Nayak, A.C., Orgun, M.A.: Three approaches to iterated belief contraction. J. Philos. Log. 41(1), 115–142 (2012)
Reis, M.D.L.: On the interrelation between systems of spheres and epistemic entrenchment relations. Log. J. IGPL 22(1), 126–146 (2014)
Rott, H.: ‘Just Because’: taking belief bases seriously. In: Buss, S.R., Hájek, P., Pudlák, P. (eds.) Lecture Notes in Logic, vol. 13, pp. 387–408. Association for Symbolic Logic, Urbana, US (1998)
Souza, M., Moreira, Á., Vieira, R.: Dynamic preference logic as a logic of belief change. In: Madeira, A., Benevides, M. (eds.) DALI 2017. LNCS, vol. 10669, pp. 185–200. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73579-5_12
Souza, M., Moreira, A., Vieira, R.: Iterated belief base change: a dynamic epistemic logic approach. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence. AAAI Press, Palo Alto, US (2019, to appear)
Souza, M., Moreira, A., Vieira, R., Meyer, J.J.C.: Preference and priorities: a study based on contraction. In: KR 2016, pp. 155–164. AAAI Press (2016)
Van Benthem, J.: Dynamic logic for belief revision. J. Appl. Non-Class. Log. 17(2), 129–155 (2007)
Van Benthem, J., Grossi, D., Liu, F.: Priority structures in deontic logic. Theoria 80(2), 116–152 (2014)
Van Riemsdijk, M.B., Dastani, M., Meyer, J.J.C.: Goals in conflict: semantic foundations of goals in agent programming. Auton. Agent. Multi-Agent Syst. 18(3), 471–500 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Souza, M., Moreira, Á. (2020). Bringing Belief Base Change into Dynamic Epistemic Logic. In: Soares Barbosa, L., Baltag, A. (eds) Dynamic Logic. New Trends and Applications. DALI 2019. Lecture Notes in Computer Science(), vol 12005. Springer, Cham. https://doi.org/10.1007/978-3-030-38808-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-38808-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-38807-2
Online ISBN: 978-3-030-38808-9
eBook Packages: Computer ScienceComputer Science (R0)