On the Computational Complexity of Spatial Logics with Connectedness Constraints (Q5505582)
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: On the Computational Complexity of Spatial Logics with Connectedness Constraints |
scientific article; zbMATH DE number 5498368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Computational Complexity of Spatial Logics with Connectedness Constraints |
scientific article; zbMATH DE number 5498368 |
Statements
On the Computational Complexity of Spatial Logics with Connectedness Constraints (English)
0 references
27 January 2009
0 references
0.92132175
0 references
0.88651156
0 references
0.8814809
0 references
0 references
0.87753826
0 references
0 references
0 references
0.8631522
0 references
