On the Computational Complexity of Spatial Logics with Connectedness Constraints

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/lpar/KontchakovPWZ08, 

 author    = {Roman Kontchakov and
              Ian Pratt-Hartmann and
              Frank Wolter and
              Michael Zakharyaschev},
 title     = {On the Computational Complexity of Spatial Logics with Connectedness
              Constraints},
 booktitle = {LPAR},
 year      = {2008},
 pages     = {574-589},
 ee        = {http://dx.doi.org/10.1007/978-3-540-89439-1_40},
 crossref  = {DBLP:conf/lpar/2008},
 bibsource = {DBLP, http://dblp.uni-trier.de}

}

\end{bibtex}

Retrieved from "http://tw.rpi.edu/wiki/On_the_Computational_Complexity_of_Spatial_Logics_with_Connectedness_Constraints"
Personal tools