Static and dynamic variable sorting strategies for backtracking-based search algorithms

19th Workshop on (Constraint) Logic Programming, W(C)LP 2005

Volumn , Issue , 2005, Pages 99-110

  Müller, Henry ^a  

^a FRAUNHOFER FIRST   (Germany)

Author keywords

AIM; Backjumping; Backtracking; Conflict directed backjumping; Constraint programming; Dynamic variable ordering; SAT; Search; Static variable ordering

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LEARNING ALGORITHMS; LOGIC PROGRAMMING;

AIM; BACKJUMPING; BACKTRACKING; CONFLICT-DIRECTED BACKJUMPING; CONSTRAINT PROGRAMMING; DYNAMIC VARIABLE ORDERING; SAT; SEARCH; STATIC VARIABLE ORDERING;

CONSTRAINT THEORY;

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

References (18)

1. Satisfiability Suggested Format. The document satformat. ps describes the cnf-format, http://www. intellektik. informatik. tu-darmstadt. de/SATLIB/Benchmarks/SAT/satformat. ps.
2. Y. Asahiro, K. Iwama, and E. Miyano. Random Generation of Test Instances with Controlled Attributes. DIMACS Series in Discrete Mathematics and Theoreti-cal Computer Science, 26: 377-394, 1996. http://dimacs. rutgers. edu/Volumes/Vol26. html.
3. Roman Barták. Online Guide To Constraint Programming, 1998. First Edition, http://kti. ms. mff. cuni. cz/~bartak/constraints/index. html.
4. X. Chen and P. Beek. Conflict-directed backjumping revisited, 2001. http://citeseer. ist. psu. edu/chen01conflictdirected. html.
5. Rina Dechter and Daniel Frost. Backjump-based Backtracking for Constraint Satisfaction Problems. 2001. http://www. ics. uci. edu/~dechter/publications/r56. html.
6. Daniel Frost. Algorithms and Heuristics for Constraint Satisfaction Problems. PhD thesis, University of California, 1997. http://www. ics. uci. edu/~dechter/publications/r69. html.
7. Daniel Frost and Rina Dechter. Look-ahead value ordering for constraint satisfaction problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'95, pages 572-578, Montreal, Canada, 1995. citeseer. ist. psu. edu/frost95lookahead. html.
8. R. Haralick and G. Elliot. Increasing tree search efficiency for constraint satisfaction problems. In Artificial Intelligence 14, pages 263-313, 1980.
9. Matthias Hoche. Analyse und Entwicklung unterschiedlicher Scheduling-Verfahren zur Laufzeit-Optimierung der Propagation eines Java-basierten Constraint-Lösers. Diplomarbeit, Technische Universität Berlin, 2004.
10. Matthias Hoche, Henry Müller, Hans Schlenker, and Armin Wolf. firstcs-A Pure Java Constraint Programming Engine. Juli 2003. submitted to the 2nd International Workshop on Multiparadigm Constraint Programming Languages (MultiCPL'03) at the 9th International Conference on Principles and Practice of Constraint Programming, CP 2003. http://uebb. cs. tu-berlin. de/MultiCPL03/Proceedings. MultiCPL03. RCoRP03. pdf.
11. A. K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8: 99-118, 1977.
12. Kim Marriott and Peter J. Stuckey. Programming with Constraints: An Introduc-tion. MIT Press, 1998.
13. Henry Müller. Analyse und Entwicklung von intelligenten abhängigkeitsgesteuerten Suchverfahren für einen Java-basierten Constraintlöser. Diplomarbeit, Technische Universität Berlin, 2004.
14. Patrick Prosser. Hybrid Algorithms For The Constraint Satisfaction Problem. Computational Intelligence, 9(3): 268, 1993.
15. Patrick Prosser. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical Report Research Report/95/177, Dept. of Computer Science, University of Strathclyde, 1995. http://citeseer. nj. nec. com/prosser95maccbj. html.
16. Patrick Prosser. The dynamics of dynamic variable ordering heuristics. Lecture Notes in Computer Science, 1520: 17, 1998. http://citeseer. ist. psu. edu/prosser98dynamics. html.
17. Laurent Simon and Philippe Chatalic. SAT-Ex: a web-based framework for SAT experimentation. http://citeseer. nj. nec. com/simon01satex. html, The web-portal SatEX http://www. lri. fr/~simon/satex/, reference-computer und scaling-benchmark dfmax http://www. lri. fr/simon/satex/aim/satexaim. php3#machine.
18. Stephen Warshall. A Theorem on Boolean Matrices. J. ACM, 9(1): 11-12, 1962. http://doi. acm. org/10-1145/321105-321107.