📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

On the Computational Complexity of Spatial Logics with Connectedness Constraints

First Author: Kontchakov R

Attributed to: Computational Logic of Euclidean Spaces funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-540-89439-1_40

Publication URI: http://dx.doi.org/10.1007/978-3-540-89439-1_40

Type: Book Chapter

Book Title: Logic for Programming, Artificial Intelligence, and Reasoning (2008)

Page Reference: 574-589

ISBN: 978-3-540-89438-4

ISSN: 2662-9984