Maintaining knowledge about temporal intervals
Communications of the ACM
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
The design and experimental analysis of algorithms for temporal reasoning
Journal of Artificial Intelligence Research
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
A divide-and-conquer approach for solving interval algebra networks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Eligible and frozen constraints for solving temporal qualitative constraint networks
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
| Hi-index | 0.00 |
The prevalent method of increasing reasoning efficiency in the domain of qualitative constraint-based spatial and temporal reasoning is to use domain splitting based on so-called tractable subclasses. In this paper we analyze the application of nogood learning with restarts in combination with domain splitting. Previous results on nogood recording in the constraint satisfaction field feature learnt nogoods as a global constraint that allows for enforcing generalized arc consistency. We present an extension of such a technique capable of handling domain splitting, evaluate its benefits for qualitative constraint-based reasoning, and compare it with alternative approaches.