Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (Q5224503)
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: Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic |
scientific article; zbMATH DE number 7084741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic |
scientific article; zbMATH DE number 7084741 |
Statements
Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic (English)
0 references
24 July 2019
0 references
interval logic
0 references
hybrid logic
0 references
computational complexity
0 references
0.9593628
0 references
0.9238696
0 references
0.9227176
0 references
0.9200366
0 references
0.9160124
0 references
0.90297496
0 references
0.9018851
0 references
0.90160906
0 references
