Change search
ReferencesLink to record
Permanent link

Direct link
Constraint satisfaction by local search
Number of Authors: 1
2002 (English)Report (Refereed)
Abstract [en]

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
Keyword [en]
Local Search, Heuristics, Constraints, Satisfiability
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14171OAI: diva2:1035458
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(827 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 827 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link