When 'knowing whether' is better than 'knowing that' - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

When 'knowing whether' is better than 'knowing that'

Abstract

We study a simple epistemic logic with a restricted language where formulas are boolean combinations of (epistemic) atoms: sequences of 'know-ing whether' operators followed by propositional variables. Our language is strictly more expressive than existing restricted languages, where atoms are sequences of epistemic operators and negations followed by propositional variables (in other words: atoms are epistemic formulas without conjunctions and disjunctions). Going further beyond existing approaches , we also introduce a 'common knowledge of a group whether' operator. We give an axiomatiza-tion for this logic and show that the model checking and satisfiability problems can be reduced to their classical counterparts.
Fichier principal
Vignette du fichier
paper_22.pdf (145.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02302984 , version 1 (01-10-2019)

Identifiers

  • HAL Id : hal-02302984 , version 1

Cite

Martin Cooper, Andreas Herzig, Faustine Maffre, Frédéric Maris, Elise Perrotin, et al.. When 'knowing whether' is better than 'knowing that'. 13èmes Journées d’Intelligence Artificielle Fondamentale (JIAF 2019), Jul 2019, Toulouse, France. ⟨hal-02302984⟩
69 View
59 Download

Share

Gmail Facebook X LinkedIn More