From k-SAT to k-CSP: Two Generalized Algorithms

Details From k-SAT to k-CSP: Two Generalized Algorithms From k-SAT to k-CSP: Two Generalized Algorithms

2008-01-21

arxiv.org/abs/0801.3147v1

Computer Science

Data Structures and Algorithms

Scientific paper

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause length k (k-SAT) can be classified into three styles: DPLL-like, PPSZ-like and Local Search, with local search algorithms having already been generalized to CSP with bounded constraint arity k (k-CSP). We generalize a DPLL-like algorithm in its simplest form and a PPSZ-like algorithm from k-SAT to k-CSP. As far as we know, this is the first attempt to use PPSZ-like strategy to solve k-CSP, and before little work has been focused on the DPLL-like or PPSZ-like strategies for k-CSP.

Affiliated with

Also associated with

No associations

Rating

From k-SAT to k-CSP: Two Generalized Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with From k-SAT to k-CSP: Two Generalized Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and From k-SAT to k-CSP: Two Generalized Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-593766