Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

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.
Fichier principal
Vignette du fichier
ijcai2015H.pdf (460.34 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01277220 , version 1 (22-02-2016)

Identifiers

  • HAL Id : hal-01277220 , version 1

Cite

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⟩
76 View
35 Download

Share

Gmail Facebook Twitter LinkedIn More