Constraint satisfaction by local search
Number of Authors: 1
2002 (English)Report (Refereed)
The constraint satisfaction problem and its derivate, the propositional satisfiability problem (SAT), are fundamental problems in computing theory and mathematical logic. SAT was the first proved NP-complete problem, and although complete algorithms have been dominating the constraint satisfaction field, incomplete approaches based on local search has been successful the last ten years. In this report we give a general framework for constraint satisfaction using local search as well as an different techniques to improve this basic local search framework. We also give an overview of algorithms for problems of constraint satisfaction and optimization using heuristics, and discuss hybrid methods that combine complete methods for constraint satisfaction with local search techniques.
Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 2002, 1. , 66 p.
SICS Technical Report, ISSN 1100-3154 ; 2002:07
Local Search, Heuristics, Constraints, Satisfiability
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-21983OAI: oai:DiVA.org:ri-21983DiVA: diva2:1041525