Skip to Main content Skip to Navigation
Conference papers

Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results

Abstract : We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents' knowledge in multi-agent contexts, such as " agent a knows as much as agent b ". We analyse the expressiveness of EQBL through a translation into monadic second-order logic, and provide completeness results w.r.t. various classes of Kripke frames. Finally, we prove that model checking EQBL is PSPACE-complete. Thus, the complexity of model checking EQBL is no harder than for (non-modal) quantified boolean logic.
Document type :
Conference papers
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download
Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Monday, February 22, 2016 - 1:00:57 PM
Last modification on : Saturday, May 1, 2021 - 3:49:00 AM
Long-term archiving on: : Sunday, November 13, 2016 - 12:35:10 AM


Files produced by the author(s)


  • HAL Id : hal-01277220, version 1


Francesco Belardinelli, Wiebe van Der Hoek. Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results. 24th International Joint Conferences on Artificial Intelligence (IJCAI 2015), Jul 2015, Buenos Aires, Argentina. pp.2748--2754. ⟨hal-01277220⟩



Record views


Files downloads