Tableau method and NEXPTIME-completeness of DEL-sequents (Q2825404)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tableau method and NEXPTIME-completeness of DEL-sequents |
scientific article; zbMATH DE number 6635957
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tableau method and NEXPTIME-completeness of DEL-sequents |
scientific article; zbMATH DE number 6635957 |
Statements
7 October 2016
0 references
dynamic epistemic logic
0 references
tableau method
0 references
computational complexity
0 references
0.8641492
0 references
0.8623693
0 references
0.8593196
0 references
0.85735774
0 references
0 references
0.8551273
0 references
0.85341495
0 references
Tableau method and NEXPTIME-completeness of DEL-sequents (English)
0 references
