TY - GEN
T1 - Local search as a fixed point of functions
AU - Monfroy, Eric
AU - Saubion, Frédéric
AU - Crawford, Broderick
AU - Castro, Carlos
PY - 2008
Y1 - 2008
N2 - Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.
AB - Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.
KW - Constraint Satisfaction Problems (CSP)
KW - Constraint solving
KW - Local search
UR - http://www.scopus.com/inward/record.url?scp=55349139682&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:55349139682
SN - 9789898111388
SN - 9789898111371
T3 - ICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
SP - 431
EP - 434
BT - ICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
T2 - ICEIS 2008 - 10th International Conference on Enterprise Information Systems
Y2 - 12 June 2008 through 16 June 2008
ER -