"On the Computational Complexity of Spatial Logics with Connectedness ..."

Roman Kontchakov et al. (2008)

> Home

Details and statistics

DOI: 10.1007/978-3-540-89439-1_40

access: closed

type: Conference or Workshop Paper

metadata version: 2023-12-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lpar/KontchakovPWZ08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpar/KontchakovPWZ08
Roman Kontchakov, Ian Pratt-Hartmann, Frank Wolter, Michael Zakharyaschev:
On the Computational Complexity of Spatial Logics with Connectedness Constraints. LPAR 2008: 574-589

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.