Last conflict based reasoning

Frontiers in Artificial Intelligence and Applications

Volumn 141, Issue , 2006, Pages 133-137

  Lecoutre, Christophe ^a   Sais, Lakhdar ^a   Tabary, Sébastien ^a   Vidal, Vincent ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; BASED REASONINGS; CONSISTENT VALUES; CONSTRAINT NETWORKS; SEARCH ALGORITHMS; SEARCH TREES; VARIABLE ORDERING HEURISTICS;

EID: 84876530582     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article

References (22)

1. F. Bacchus, 'Extending Forward Checking', in Proceedings of CP'00, pp. 35-51, (2000).
2. C. Bessière and J. Régin, 'MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems', in Proceedings of CP'96, pp. 61-75, (1996).
3. C. Bessière, J.C. Régin, R.H.C. Yap, and Y. Zhang, 'An optimal coarsegrained arc consistency algorithm', Artificial Intelligence, 165(2), 165-185, (2005).
4. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, 'Boosting systematic search by weighting constraints', in Proceedings of ECAI'04, pp. 146-150, (2004).
5. D. Brelaz, 'New methods to color the vertices of a graph', Communications of the ACM, 22, 251-256, (1979).
6. X. Chen and P. van Beek, 'Conflict-directed backjumping revisited', Journal of Artificial Intelligence Research, 14, 53-81, (2001).
7. R. Debruyne and C. Bessière, 'Some practical filtering techniques for the constraint satisfaction problem', in Proceedings of IJCAI'97, pp. 412-417, (1997).
8. R. Dechter, Constraint processing, Morgan Kaufmann, 2003.
9. F. Focacci and M. Milano, 'Global cut framework for removing symmetries', in Proceedings of CP'01, pp. 77-92, (2001).
10. J. Gaschnig, 'Performance measurement and analysis of search algorithms.', Technical Report CMU-CS-79-124, Carnegie Mellon, (1979).
11. M. Ginsberg, 'Dynamic backtracking', Artificial Intelligence, 1, 25-46, (1993).
12. R.M. Haralick and G.L. Elliott, 'Increasing tree search efficiency for constraint satisfaction problems', Artificial Intelligence, 14, 263-313, (1980).
13. T. Hulubei and B. O'Sullivan, 'Search heuristics and heavy-tailed behaviour', in Proceedings of CP'05, pp. 328-342, (2005).
14. J. Hwang and D.G. Mitchell, '2-way vs d-way branching for CSP', in Proceedings of CP'05, pp. 343-357, (2005).
15. U. Junker, 'QuickXplain: preferred explanations and relaxations for over-constrained problems', in Proceedings of AAAI'04, pp. 167-172, (2004).
16. N. Jussien, R. Debruyne, and P. Boizumault, 'Maintaining arcconsistency within dynamic backtracking', in Proceedings of CP'00, pp. 249-261, (2000).
17. G. Katsirelos and F. Bacchus, 'Generalized nogoods in csps', in Proceedings of AAAI'05, pp. 390-396, (2005).
18. C. Lecoutre, F. Boussemart, and F. Hemery, 'Backjump-based techniques versus conflict-directed heuristics', in Proceedings of ICTAI'04, pp. 549-557, (2004).
19. O. Lhomme, 'Quick shaving', in Proceedings of AAAI'05, pp. 411-415, (2005).
20. P. Prosser, 'Hybrid algorithms for the constraint satisfaction problems', Computational Intelligence, 9(3), 268-299, (1993).
21. D. Sabin and E. Freuder, 'Contradicting conventional wisdom in constraint satisfaction', in Proceedings of CP'94, pp. 10-20, (1994).
22. L. Zhang, C.F. Madigan, M.W. Moskewicz, and S. Malik, 'Efficient conflict driven learning in a Boolean satisfiability solver', in Proceedings of ICCAD'01, pp. 279-285, (2001).