AB - Dealing with spatial and temporal knowledge is an indispensable part of almost all aspects of human activities. The qualitative approach to spatial and temporal reasoning (QSTR) provides a promising framework for spatial and temporal knowledge representation and reasoning. QSTR typically represents spatial/temporal knowledge in terms of qualitative relations (e.g., to the east of, after), and reasons with the knowledge by solving qualitative constraints. When formulating a qualitative constraint satisfaction problem (CSP), it is usually assumed that each variable could be "here, there and everywhere2." Practical applications e.g. urban planning, however, often require a variable taking values from a certain finite subset of the universe, i.e. require it to be 'here or there'. This paper extends the classic framework of qualitative constraint satisfaction by allowing variables taking values from finite domains. The computational complexity of this extended consistency problem is examined for five most important qualitative calculi, viz. Point Algebra, Interval Algebra, Cardinal Relation Algebra, RCC-5, and RCC-8. We show that the extended consistency problem remains in NP, but when only basic constraints are considered, the extended consistency problem for each calculus except Point Algebra is already NP-hard. © 2012 The Author(s).
AU - Liu, W
AU - Li, S
DA - 2012/01/01
DO - 10.3233/978-1-61499-098-7-552
EP - 557
JO - Frontiers in Artificial Intelligence and Applications
PY - 2012/01/01
SP - 552
TI - Here, there, but not everywhere: An extended framework for qualitative constraint satisfaction
VL - 242
Y1 - 2012/01/01
Y2 - 2022/12/10
ER -