Dynamic Epistemic Logic with Communication Actions
| Autor: | Mario R. F. Benevides, Isaque Macalam Saab Lima |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Soundness
Reduction (recursion theory) Theoretical computer science General Computer Science Computer science Concurrency Process calculus Theoretical Computer Science Decidability TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Action (philosophy) TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Completeness (logic) Dynamic epistemic logic |
| Zdroj: | LSFA |
| ISSN: | 1571-0661 |
| DOI: | 10.1016/j.entcs.2019.07.005 |
| Popis: | This work proposes a Dynamic Epistemic Logic with Communication Actions that can be performed concurrently. Unlike Concurrent Epistemic Action Logic introduced by Ditmarsch, Hoek and Kooi [van Ditmarsch, H., W. van der Hoek and B. Kooi, “Concurrent Dynamic Epistemic Logic,” Kluwer, Ed. V.F. Hendricks et al., vol. 322, 2003], where the concurrency mechanism is the so called true concurrency, here we use an approach based on process calculus, like CCS and CSP, and Action Models Logic. Our approach makes possible the proof of soundness, completeness and decidability, different from the others approaches. We present an axiomatisation and show that the proof of soundness, completeness and decidability can be done using a reduction method. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect