TY - GEN
T1 - Preprocessing expression-based constraint satisfaction problems for stochastic local search
AU - Sabato, Sivan
AU - Naveh, Yehuda
PY - 2007/1/1
Y1 - 2007/1/1
N2 - This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic local search solver. The architecture we use to implement the methods allows the extension of the expression language by user-defined operators, while still benefiting from the processing methods. Results from various domains, including industrial processor verification problems, show the strength of the methods. As one of our test cases, we introduce the concept of random-expression CSPs as a new form of random CSPs. We believe this form emulates many real-world CSPs more closely than other forms of random CSPs. We also observe a satisfiability phase transition in this type of problem ensemble.
AB - This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic local search solver. The architecture we use to implement the methods allows the extension of the expression language by user-defined operators, while still benefiting from the processing methods. Results from various domains, including industrial processor verification problems, show the strength of the methods. As one of our test cases, we introduce the concept of random-expression CSPs as a new form of random CSPs. We believe this form emulates many real-world CSPs more closely than other forms of random CSPs. We also observe a satisfiability phase transition in this type of problem ensemble.
UR - http://www.scopus.com/inward/record.url?scp=37149035992&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72397-4_18
DO - 10.1007/978-3-540-72397-4_18
M3 - Conference contribution
AN - SCOPUS:37149035992
SN - 354072396X
SN - 9783540723967
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 244
EP - 259
BT - Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 4th International Conference, CPAIOR 2007, Proceedings
PB - Springer Verlag
T2 - 4th International Conference on Integration of Artificial Intelligence, Constraint Programming, and Operations Research Techniques for Combinatorial Optimization Problems, CPAIOR 2007
Y2 - 23 May 2007 through 26 May 2007
ER -