Abstract
Ockhamist Propositional Dynamic Logic (\(\mathsf {OPDL}\)) is a logic unifying the family of dynamic logics and the family of branching-time temporal logics, two families of logic widely used in AI to model reactive systems and multi-agent systems (MAS). In this paper, we present two variants of this logic. These two logics share the same language and differ only in one semantic condition. The first logic embeds Bundled \(\textsf {CTL}^* \) while the second embeds \(\textsf {CTL}^* \). We provide a 2EXPTIME decision procedure for the satisfiability problem of each variant. The decision procedure for the first variant of \(\mathsf {OPDL}\) is based on the elimination of Hintikka sets while the decision procedure for the second variant relies on automata.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
- 2.
Due to space restriction, this version of the paper contains only sketches of proofs of some theorems.
References
Alur, R., Henzinger, T., Kupferman, O.: Alternating-time temporal logic. J. ACM 49(5), 672–713 (2002)
Balbiani, P., Lorini, E.: Ockhamist propositional dynamic logic: a natural link between PDL and CTL*. In: Libkin, L., Kohlenbach, U., Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol. 8071, pp. 251–265. Springer, Heidelberg (2013). doi:10.1007/978-3-642-39992-3_22
Belnap, N., Perloff, M., Xu, M.: Facing the Future: Agents and Choices in Our Indeterminist World. Oxford University Press, New York (2001)
Brown, M., Goranko, V.: An extended branching-time Ockhamist temporal logic. J. Logic Lang. Inform. 8(2), 143–166 (1999)
Dam, M.: CTL* and ECTL* as fragments of the modal mu-calculus. Theoret. Comput. Sci. 126(1), 77–96 (1994)
David, A., Schewe, S.: Deciding ATL\(^*\) satisfiability by tableaux. Technical report, Laboratoire IBISC - Université d’Evry Val-d’Essonne (2016)
Emerson, E., Sistla, A.: Deciding full branching time logic. Inf. Control 61, 175–201 (1984)
Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM J. Comput. 29(1), 132–158 (1999)
Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194–211 (1979)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. MIT Press, Cambridge (2000)
Piterman, N.: From nondeterministic Büchi and Streett automata to deterministic parity automata. In: Logic in Computer Science (LICS), pp. 255–264. IEEE Computer Society (2006)
Pratt, V.R.: Models of program logics. In: 20th Annual Symposium on Foundations of Computer Science, pp. 115–122. IEEE Computer Society (1979)
Prior, A.: Past, Present, and Future. Clarendon Press, Oxford (1967)
Reynolds, M.: An axiomatization of full computation tree logic. J. Symbol. Logic 66(3), 1011–1057 (2001)
Reynolds, M.: A tableau for bundled CTL*. J. Logic Comput. 17(1), 117–132 (2007)
Streett, R.S.: Propositional dynamic logic of looping and converse is elementarily decidable. Inf. Control 54(1–2), 121–141 (1982)
Thomason, R.: Combinations of tense and modality. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 2, 2nd edn, pp. 135–165. Reidel, Dordrecht (1984)
Vardi, M.Y., Wolper, P.: Yet another process logic (preliminary version). In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol. 164, pp. 501–512. Springer, Heidelberg (1984). doi:10.1007/3-540-12896-4_383
Wolper, P.: A translation from full branching time temporal logic to one letter propositional dynamic logic with looping (unpublished manuscript)
Zanardo, A.: Branching-time logic with quantification over branches: the point of view of modal logic. J. Symbol. Logic 61(1), 143–166 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Boudou, J., Lorini, E. (2016). Decidability and Expressivity of Ockhamist Propositional Dynamic Logics. In: Michael, L., Kakas, A. (eds) Logics in Artificial Intelligence. JELIA 2016. Lecture Notes in Computer Science(), vol 10021. Springer, Cham. https://doi.org/10.1007/978-3-319-48758-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-48758-8_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48757-1
Online ISBN: 978-3-319-48758-8
eBook Packages: Computer ScienceComputer Science (R0)