The complexity of satisfiability for fragments of hybrid logic. I. (Q631087)
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: The complexity of satisfiability for fragments of hybrid logic. I. |
scientific article; zbMATH DE number 5869150
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of satisfiability for fragments of hybrid logic. I. |
scientific article; zbMATH DE number 5869150 |
Statements
The complexity of satisfiability for fragments of hybrid logic. I. (English)
0 references
22 March 2011
0 references
hybrid logic
0 references
satisfiability
0 references
decidability
0 references
complexity
0 references
Post's lattice
0 references
0.998646080493927
0 references
0.851031482219696
0 references
0.8507577180862427
0 references
0.8505970239639282
0 references
0.8503075242042542
0 references
