On the Computational Complexity of Spatial Logics with Connectedness Constraints

From Tetherless World Wiki

Jump to: navigation, search
 On the Computational Complexity of Spatial Logics with Connectedness Constraints
Has publishing details  pp. 574-589, 2008
Has title  On the Computational Complexity of Spatial Logics with Connectedness Constraints
Has where published  LPAR
Has year  2008
Has author  Roman Kontchakov +, Ian Pratt-Hartmann +, Frank Wolter +, Michael Zakharyaschev +
Has identifier  DBLP:conf/lpar/KontchakovPWZ08 +
Categories  Proceeding Paper +

 

Enter the name of the page to start browsing from.
Retrieved from "http://tw.rpi.edu/wiki/Special:Browse"
Views
Personal tools