Questions regarding solver programs for the boolean satisfiability problem.
Questions tagged [sat-solvers]
118 questions
35
votes
3 answers
Encoding 1-out-of-n constraint for SAT solvers
I'm using a SAT solver to encode a problem, and as part of the SAT instance, I have boolean variables $x_1,x_2,\dots,x_n$ where it is intended that exactly one of these should be true and the rest should be false. (I've sometimes seen this …
D.W.
- 167,959
- 22
- 232
- 500
21
votes
1 answer
Why do all recent SAT solvers work on CNF instead of circuit SAT?
After the release of the AIGER library to handle and-inverter graphs sometime in 2006 (I think), some circuit SAT solvers were released in 2006-2008, and in a few SAT Races/Competitions there were AIG tracks. However since then it seems the focus…
Sami Liedes
- 393
- 1
- 4
21
votes
1 answer
Proving that the conversion from CNF to DNF is NP-Hard
How can I prove that the conversion from CNF to DNF is NP-Hard?
I'm not asking for an answer, just some suggestions about how to go about proving it.
jkjk
- 311
- 2
- 3
20
votes
3 answers
Recipe book for SAT encodings?
SAT solvers are getting more and more efficient in solving large instances and are being used as back-ends in various contexts.
Every time one wants to use them to solve a problem in a specific domain, he/she has to come up with an ad-hoc encoding…
Bordaigorl
- 425
- 4
- 14
20
votes
1 answer
When to use SAT vs Constraint Satisfaction?
If I have a hard problem, one standard approach is to express it as a SAT instance and try running a SAT solver on it. Another standard approach is to express it as a constraint satisfaction problem, and try using a CSP solver. The two feel…
D.W.
- 167,959
- 22
- 232
- 500
13
votes
1 answer
Unification vs. SAT solver
I read on Wikipedia that unification is a process of solving the satisfability problem.
At the same time, I know that such solvers are called "SAT solvers" or "SMT solvers". So, are they different names for the same thing?
If you say that they are…
Val
- 857
- 6
- 16
13
votes
3 answers
Multicore SAT Solver
I am trying to solve a 25k clauses 5k variables SAT problem. As it has been running for an hour (precosat) and I'd like to solve bigger ones afterwards, I'm looking for a multi-core SAT-Solver.
As there seem to be many SAT-Solvers, I'm quite…
multsatsolv
- 131
- 4
12
votes
4 answers
Are there competitions for integer programming?
Are there competitions for integer programming like there are for SAT and MAXSAT?
Omar Shehab
- 326
- 1
- 10
11
votes
1 answer
Can top SAT-solvers factor easy numbers?
Modern SAT-solvers are very good at solving many real-world examples of SAT instances. However, we know how to generate hard ones: for instance use a reduction from factoring to SAT and give the RSA numbers as input.
This raises the question: what…
Artem Kaznatcheev
- 4,872
- 2
- 28
- 57
10
votes
2 answers
Introduction into first order logic verification
I am trying to teach myself different approaches to software verification. I have read some articles. As far as I learned, propositional logic with temporal generally uses model checking with SAT solvers (in ongoing - reactive systems), but what…
FELIPE N.
- 135
- 4
9
votes
1 answer
Why the need for TSP solvers when there are SAT solvers?
Concorde TSP is a solver for TSP. SAT solvers are solvers for boolean satisfiability. TSP and SAT are NP-complete.
Hence, why spent the time to develop Concorde TSP when there is an abundance of SAT solvers in the market back then?
Jessica Cage
- 93
- 3
9
votes
1 answer
Conflict Driven Clause Learning backtracking clarification
On the wikipedia page here it describes pretty well the CDCL algorithm (and it seems the pictures were taken from slides created by Sharad Malik at Princeton). However when describing how to backtrack all it says is "to the appropriate point".…
Jake
- 3,810
- 21
- 35
8
votes
4 answers
Deterministic SAT solver
I have the following question. Is the SAT solvers are deterministic?
I mean, for example, about miniSAT and DPLL algorithm. Are they completely deterministic?
If these algorithms will return unSAT it means that certainly the solution does not exist?
user64231
- 81
- 1
8
votes
1 answer
Why is pure literal elimination absent in DPLL-based algorithms like Chaff?
I'm looking into various SAT-solvers and trying to understand how they work and why they are designed in certain ways. (But I'm not in a university at the moment and I do not know anyone who is a professor. So I'm posting here hoping that someone…
Archy Will He
- 612
- 4
- 17
8
votes
2 answers
Assignment to make formula unsatisfiable
Lets imagine we have a satisfiable formula $F(A_0, A_1,...A_k,S_0,...,S_n)$ The problem to solve is "Is there an assignment for variables $(S_0,...,S_n)$ which will make F unsatisfiable?". One way of solving is to find all solutions for F in terms…
Grigor Aghanyan
- 83
- 4