On the Computational Complexity of Spatial Logics with Connectedness Constraints
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