On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus

From Tetherless World Wiki

Jump to: navigation, search

\begin{bibtex} @inproceedings{DBLP:conf/ijcai/RenzN97, title={On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus}, pages={522-527}, year={1997}, booktitle={IJCAI (1)}, url={http://www.informatik.uni-trier.de/~ley/db/conf/ijcai/ijcai97.html#RenzN97}, author={Jochen Renz and Bernhard Nebel} }\end{bibtex}

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