Stack Overflow
Stack Overflow

Questions tagged [sat-solvers]

SAT solvers are a class of algorithms for solving satisfiability problem of boolean formulas.

SAT solvers are a class of algorithms for solving satisfiability problem of boolean formulas.

SAT was the first known example of an NP-complete problem. Since then, there are a lot of research regarding how to efficiently solve a large enough subset of SAT instances to be useful in various practical areas.

References:

80 questions
0
votes
1 answer

Algorithm to parse an expression and assinging a value that satisfies the conditions

The requirement is to parse a complex expression and assign the value to the variable that satisfies the condition. For e.g. ((!(($weatherResult.cityName=="Seattle")||($weatherResult.cityName=="Portland")))&&($weatherResult.cityName=="Folsom")) So…
Vignesh
  • 3
  • 2
0
votes
0 answers

Wcnf dimacs how to get the value with highest weight

Let's say i have this problem and wanted to solve it using dimacs and maxsat solvers There's 10 police patrols and i want solver to pick the best police patrol to go to intervention, each patrol is described by 3 variables (status, distance,…
Andrzej Dach
  • 3
  • 2
0
votes
1 answer

How to solve a DNF-SAT problem with PySAT?

is there any support for DNF formulas with PySAT? For example, can I call a SAT solver on a DNF formula using this module. In particular is there any way to turn a DNF into CNF using this python module? I looked at the documentation but there seems…
user22115
  • 1
0
votes
1 answer

NuSMV getting stuck on pick_state command

I'm making a model of a graph where messages are being routed over channels between nodes for a homework assignment. (Basically, the messages only contain the id of the destination node, nodes can create messages and route them by a predefined…
Th F
  • 1
  • 1
0
votes
1 answer

Satisfiability 3-towers assignment

I have stared at this assignment for far too long now and I simply don't understand what I am supposed to do exactly. We are given a 3x3 chess board and have to produce some propositonal clauses to this problem. This is what information we have been…
Karim Loberg
  • 31
  • 4
0
votes
1 answer

SAT Solving scheduling problem with Personnel, Skill, Attractionposition and schedule

While I am not new to development, I am very new to SAT solving. I have an old codebase solving a schema problem (not using SAT) and I am trying to use google OR tools and a combination of “Employee Scheduling” and “The Job Shop Problem”. Base…
Claes
  • 11
  • 2
0
votes
0 answers

How to translate a boolean formula into CNF for a SAT Solver?

I'm trying to solve Minesweeper with a SAT Solver. So far i understand the general logic of the game, how the SAT Solver works and how to implement it. However i can't wrap my head around, how to translate my boolean formula into a CNF in order to…
philuix
  • 109
  • 1
  • 7
0
votes
1 answer

Logic equivalence of sub-signals of logically equivalent signals

I have two logic output which I know are logically equivalent (proven using SAT solvers). Now I choose same bits from both signals. Can I say since the complete signals are equivalent then sub-signals will also be equivalent? eg. N-bit signal -…
instance
  • 1,366
  • 15
  • 23
0
votes
1 answer

SAT Solvers and Phase Saving

DPLL SAT solvers typically apply a Phase Saving heuristic. The idea is to remember the last assignment of each variable and use it first in branching. To experiment with the effects of branching polarity and phase saving, I tried several SAT…
Axel Kemper
  • 10,544
  • 2
  • 31
  • 54
0
votes
1 answer

Why Z3 falling at this?

i'm trying to solve this using z3-solver but the proplem is that it gives me wrong values i tried to replace the >> with LShR the values changes but non of them is corrent however i know the value of w should be 0x41414141 in hex i also tried to set…
Ahmed Ezzat
  • 65
  • 10
0
votes
1 answer

/usr/bin/ld: cannot find -lcplex

I'm trying to set up MaxHS SAT solver from this git repo - https://github.com/fbacchus/MaxHS. I get an error that says '/usr/bin/ld: cannot find -lcplex'. Can anyone guide me on what is lcplex library and how to fix this? My console looks like…
Akhil Dixit
  • 125
  • 1
  • 2
  • 8
0
votes
1 answer

About sat4j, how to use sat4j to solve pseudo boolean problems?

I have pseudo boolean problems and I need to solve it with sat4j. Can someone help me? Here's my problem: I have a list of variables named: a,b,c,d,e,f And I have a list of values represented by: #1, #2, #3..... h(a,#1) means assign #1 to a I have…
JulieZhu
  • 1
0
votes
3 answers

How do I convert a series of mathematical constraints into a SAT or a SMT problem and get an answer?

I have an arbitrary set of constraints. For example: A, B, C and D are 8-bit integers. A + B + C + D = 50 (A + B) = 25 (C + D) = 30 A < 10 I can convert this to a SAT problem that can be solved by picosat (I can't get minisat to compile on my…
vy32
  • 28,461
  • 37
  • 122
  • 246
0
votes
1 answer

CNF vs Horn Satisfiability

I know that it's easier to prove if a horn-formula is satisfiable. My Question is: Why is it easier with a horn formula rather than a normal CNF?
noctua
  • 115
  • 10
0
votes
1 answer

Is there an easy-to-use 0-1 IP solver for java?

I would like to use a 0-1 integer programming solver as a tool in a java program. I cannot find anything easy to use on the web. I tried the pseudo-boolean library from sat4j but this is not well documented, some classes are not consistent with…
user109711
  • 3
  • 1
1 2 3 4
5
6