-
I'm trying to figure out why the z3 solver returns an unknown for a particular formula.
The formula is representative of a certain piece of code with a loop which does "abstract" multiplication (w…
-
E.g., from your co-authored paper "Principled Network Reliability Approximation: A Counting-Based Approach" I encoded Fig 1. like so:
```
c ind 1 2 3 4 5 0
p cnf 11 14
2 -3 -9 0
-7 4 -1 0
4 -3…
-
This is not an issue but rather than a question.
I am using OR-Tools (c# version) with a CVRPTW solution.
It is a fantastic library! However, I am running the solution with 1400-2000 locations…
-
**What version of OR-tools and what language are you using?**
```
Version: v8.0.8.
Language: Java
```
**Which solver are you using (e.g. CP-SAT, Routing Solver, GLOP, BOP, Gurobi)**
```
SCIP
…
-
Hi,
I have a project where I want to use ApproxMC to count the number of satisfying assignments.
However, I have to make many, many such calls for very similar formulas. It is not feasible to
cr…
-
Hi,
This has caused me a 4h debugging session :D Apparently, the `CUFLAGS = [...] -arch=sm_${SMVER}` needs to be included into the `Makefile` under `gpu` or it won't work :( It basically will compi…
msoos updated
3 years ago
-
CBMC version: master and Release 5.12
Operating system: Linux (Debian and Ubuntu)
Exact command line resulting in the issue: make -C src IPASIR=/home/ubuntu/cryptominisat/src LIBS="/home/ubuntu/…
jmony updated
3 years ago
-
Is there a way to call solvers for `SMTLib` formulas within `K`?
Something with the intuition of the following rule:
```
rule M => M' PC requires Sat(PC)
```
The idea is that a transition is t…
-
I am successfully using the ortools (old) CspSolver, but I want to migrate to the ortools SatSolver (.Net).
Therefore I converted my complex constraints to cnf (normal form) and compared the perfor…
-
Hello, I have a weird issue.
I have a maximization problem and whenever I run it with the basic restrictions it gives me an optimal awnser. Where the optimal is to set all the variables im maximizin…