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 metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01277220
Contributor : Frédéric Davesne <>
Submitted on : Monday, February 22, 2016 - 1:00:57 PM
Last modification on : Monday, October 28, 2019 - 10:50:21 AM
Long-term archiving on: Sunday, November 13, 2016 - 12:35:10 AM

File

ijcai2015H.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01277220, version 1

Citation

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⟩

Share

Metrics

Record views

96

Files downloads

40