Skip to Main content Skip to Navigation
Conference papers

Decidability and Expressivity of Ockhamist Propositional Dynamic Logics

Abstract : Ockhamist Propositional Dynamic Logic (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 CTLé while the second embeds CTLé. We provide a 2EXPTIME decision procedure for the satisfiability problem of each variant. The decision procedure for the first variant of OPDL is based on the elimination of Hintikka sets while the decision procedure for the second variant relies on automata.
Keywords : Decision procedure
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Tuesday, April 3, 2018 - 4:29:12 PM
Last modification on : Monday, July 4, 2022 - 10:09:58 AM


Files produced by the author(s)


  • HAL Id : hal-01757358, version 1
  • OATAO : 18932


Joseph Boudou, Emiliano Lorini. Decidability and Expressivity of Ockhamist Propositional Dynamic Logics. 15th European Conference on Logics in Artificial Intelligence (JELIA 2016), Nov 2016, Larnaca, Cyprus. pp. 144-158. ⟨hal-01757358⟩



Record views


Files downloads