Question

SAT can be verified in polynomial time, by a conversion to CNF, then verifying the SAT of the CNF in polynomial. What is wrong with this argument?

score 253 · Answer 1 · 2023-08-26T09:45:38.313000

SAT can be verified in polynomial time, by a conversion to CNF, then verifying the SAT of the CNF in polynomial. What is wrong with this argument?

score 122 · Answer 2 · 2023-04-03T11:39:02.140000

122

Views

How can I perform validity of ∃∀.φ, if I use quantifier elimination for ∀.φ and get φ'? I hypothetise ∃φ' solves satisfiability, not validity

Published on 03 April 2023 at 11:39

score 207 · Answer 3 · 2023-03-09T08:08:01.183000

207

Views

Specifying modular arithmetic conditions in Z3

Published on 09 March 2023 at 08:08

score 334 · Answer 4 · 2023-02-13T16:00:35.653000

334

Views

Example of unique 3sat solution

Published on 13 February 2023 at 16:00

score 202 · Answer 5 · 2023-01-20T13:52:54.010000

202

Views

z3 solver using Sympy symbols

Published on 20 January 2023 at 13:52

score 98 · Answer 6 · 2023-01-11T16:05:59.237000

98

Views

What does a model mean in a universally quantified formula? Is it a function?

Published on 11 January 2023 at 16:05

score 166 · Answer 7 · 2023-01-11T11:44:41.313000

166

Views

In Z3, I cannot understand result of quantifier elimination of Exists y. Forall x. (x>=2) => ((y>1) /\ (y<=x))

Published on 11 January 2023 at 11:44

score 157 · Answer 8 · 2022-12-04T16:34:58.560000

157

Views

Some questions about dReal: delta-satisfiability, parameter with 0.0, doing the same in Z3 and obtaining sat/unsat result

Published on 04 December 2022 at 16:34

score 152 · Answer 9 · 2022-11-29T16:06:20.067000

152

Views

How can I specify a function in Minizinc that returns True if a boolean array contains at least one True element, and False otherwise?

Published on 29 November 2022 at 16:06

score 123 · Answer 10 · 2022-10-31T10:18:08.057000

123

Views

Derivation in the Resolution Proof System

Published on 31 October 2022 at 10:18

score 129 · Answer 11 · 2022-10-25T20:16:08.960000

129

Views

Dimacs cnf expression not satisfiable, why?

Published on 25 October 2022 at 20:16

score 61 · Answer 12 · 2022-10-19T09:10:50.763000

61

Views

Satisfiability 3-towers assignment

Published on 19 October 2022 at 09:10

score 371 · Answer 13 · 2022-04-09T01:41:26.153000

371

Views

Converting circuit benchmark to CNF formula to use to solve with SAT solvers

Published on 09 April 2022 at 01:41

score 380 · Answer 14 · 2022-03-10T18:49:48.657000

380

Views

Generating DIMACS CNF file using bc2cnf is missing AND

Published on 10 March 2022 at 18:49

score 627 · Answer 15 · 2022-02-08T13:37:13.670000

627

Views

How to use soft constraints in Z3-Python to express 'abstract' biases in SAT search: such as 'I prefer half of the literals to be true and half false'

Published on 08 February 2022 at 13:37

score 82 · Answer 16 · 2022-01-25T09:14:58.733000

82

Views

Flip/change satisfiability of SAT problem

Published on 25 January 2022 at 09:14

score 224 · Answer 17 · 2022-01-19T13:37:31.270000

224

Views

How to bias Z3's (Python) SAT solving towards a criteria, such as 'preferring' to have more negated literals

Published on 19 January 2022 at 13:37

score 156 · Answer 18 · 2022-01-13T17:26:44.703000

156

Views

Some questions about incremental SAT in Z3: can it be deactivated? Which techniques are used inside?

Published on 13 January 2022 at 17:26

score 333 · Answer 19 · 2021-12-28T00:23:23.860000

333

Views

Z3-Python as SAT solver does not give right results

Published on 28 December 2021 at 00:23

score 312 · Answer 20 · 2021-11-09T19:09:35.343000

312

Views

Calling Z3 as black box from Ocaml

Published on 09 November 2021 at 19:09

List Question

SAT can be verified in polynomial time, by a conversion to CNF, then verifying the SAT of the CNF in polynomial. What is wrong with this argument?

How can I perform validity of ∃∀.φ, if I use quantifier elimination for ∀.φ and get φ'? I hypothetise ∃φ' solves satisfiability, not validity

Specifying modular arithmetic conditions in Z3

Example of unique 3sat solution

z3 solver using Sympy symbols

What does a model mean in a universally quantified formula? Is it a function?

In Z3, I cannot understand result of quantifier elimination of Exists y. Forall x. (x>=2) => ((y>1) /\ (y<=x))

Some questions about dReal: delta-satisfiability, parameter with 0.0, doing the same in Z3 and obtaining sat/unsat result

How can I specify a function in Minizinc that returns True if a boolean array contains at least one True element, and False otherwise?

Derivation in the Resolution Proof System

Dimacs cnf expression not satisfiable, why?

Satisfiability 3-towers assignment

Converting circuit benchmark to CNF formula to use to solve with SAT solvers

Generating DIMACS CNF file using bc2cnf is missing AND

How to use soft constraints in Z3-Python to express 'abstract' biases in SAT search: such as 'I prefer half of the literals to be true and half false'

Flip/change satisfiability of SAT problem

How to bias Z3's (Python) SAT solving towards a criteria, such as 'preferring' to have more negated literals

Some questions about incremental SAT in Z3: can it be deactivated? Which techniques are used inside?

Z3-Python as SAT solver does not give right results

Calling Z3 as black box from Ocaml

Trending Questions

Popular # Hahtags

Popular Questions