Qualitative CSP, finite CSP, and SAT: Comparing methods for qualitative constraint-based reasoning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2009, Pages 628-633

  Westphal, Matthias ^a   Wölfl, Stefan ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOMINERALIZATION; ENCODING (SYMBOLS); PATHOLOGY;

ALLEN'S INTERVAL ALGEBRA; CONSTRAINT PROPAGATION ALGORITHMS; EMPIRICAL STUDIES; QUALITATIVE CONSTRAINTS; QUALITATIVE REASONING; QUALITATIVE SPATIAL AND TEMPORAL REASONING; REASONING METHODS; TEMPORAL INFORMATION;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 77956045112     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. James F. Allen. Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832-843, 1983.
2. Brandon Bennett. Logical Representations for Automated Reasoning about Spatial Relationships. PhD thesis, The University of Leeds, 1997.
3. Christian Bessière. A simple way to improve path consistency processing in interval algebra networks. In AAAI/IAAI, Vol. 1, pages 375-380, 1996.
4. Christian Bessière. Constraint propagation. Technical Report LIRMM 06020, CNRS/University of Montpellier, 2006.
5. Frédéric Boussemart, Fred Hemery, Christophe Lecoutre, and Lakhdar Sais. Boosting systematic search by weighting constraints. In ECAI 2004, pages 146-150. IOS Press, 2004.
6. Sebastian Brand. Relation variables in qualitative spatial reasoning. In KI 2004, LNCS: 3238, pages 337-350. Springer, 2004.
7. Jean-François Condotta, Dominique D'Almeida, Christophe Lecoutre, and Lakhdar Sais. From qualitative to discrete constraint networks. InWorkshop on Qualitative Constraint Calculi held with KI 2006, pages 54-64, Bremen, Germany, 2006.
8. Jean-François Condotta, Gérard Ligozat, and Mahmoud Saade. Eligible and frozen constraints for solving temporal qualitative constraint networks. In CP 2007, LNCS: 4741, pages 806-814. Springer, 2007.
9. Yannis Dimopoulos and Kostas Stergiou. Propagation in CSP and SAT. In CP 2006, LNCS: 4204, pages 137-151. Springer, 2006.
10. Niklas Eén and Niklas Sörensson. An extensible SAT-solver. In SAT 2003, LNCS: 2919, pages 502-518. Springer, 2003.
11. Zeno Gantner, MatthiasWestphal, and Stefan Wölfl. GQR - A fast reasoner for binary qualitative constraint calculi. In AAAI-08 Workshop on Spatial and Temporal Reasoning, Chicago, USA, AAAI, 2008.
12. Emmanuel Hebrard. Mistral, a constraint satisfaction library. In Proceedings of the Third International CSP Solver Competition, 2008.
13. Peter B. Ladkin and Alexander Reinefeld. Fast algebraic methods for interval constraint problems. Ann. Math. Artif. Intell., 19(3-4):383-411, 1997.
14. Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, and Vincent Vidal. Last conflict based reasoning. In ECAI 2006, pages 133-137. IOS Press, 2006.
15. Gérard Ligozat and Jochen Renz. What is a qualitative calculus? A general framework. In PRICAI 2004, LNCS: 3157, pages 53-64. Springer, 2004.
16. Reinhard Moratz. Qualitative spatial reasoning about oriented points. Technical Report 003/10-2004, SFB/TR 8 Spatial Cognition, 2004.
17. Bernhard Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-horn class. Constraints, 1(3):175-190, 1997.
18. Duc Nghia Pham, John Thornton, and Abdul Sattar. Towards an efficient SAT encoding for temporal reasoning. In CP 2006, LNCS: 4204, pages 421-436. Springer, 2006.
19. David A. Randell, Zhan Cui, and Anthony G. Cohn. A spatial logic based on regions and connection. In KR 1992, pages 165-176, 1992.
20. Jochen Renz and Bernhard Nebel. Efficient methods for qualitative spatial reasoning. J. Artif. Intell. Res. (JAIR), 15:289-318, 2001.
21. TobyWalsh. SAT v CSP. In CP 2000, LNCS: 1894, pages 441-456. Springer, 2000.