Abstract
We define a calculus for spatial reasoning on a grid structure, present a logical calculus, investigate the complexity of the satisfiability problem, we prove its NP completeness and specify additionally a concrete algorithm for solving it.
Cite
CITATION STYLE
APA
Ragni, M. (2003). An arrangement calculus, its complexity, and algorithmic properties. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2821, pp. 580–590). Springer Verlag. https://doi.org/10.1007/978-3-540-39451-8_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free