StackOverflow Questions for Tag: satisfiability

Justin Carrey

Reputation: 3851

Boolean formula encoding

mathnp-completenpnp-hardsatisfiability

Score: 1

Answers: 2

Shore

Reputation: 1033

What is the normal procedure of z3 handle axiom with quantifier?

z3smtfirst-order-logicsatisfiability

Score: 0

Answers: 0

Poojal Katiyar

Reputation: 1

write encodings in Z3 Solver python for string functions like concat

z3pyverifysatisfiability

Score: -1

Answers: 1

user

Reputation: 33

Example of unique 3sat solution

satsatisfiability

Score: 0

Answers: 4

templatetypedef

Reputation: 373082

Algorithms with superexponential runtime?

algorithmtime-complexitybig-osatisfiability

Score: 21

Answers: 5

RunTimeError31415

Reputation: 51

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?

logicsatisfiabilitycnf

Score: 0

Answers: 3

Maria S.

Reputation: 11

Flip/change satisfiability of SAT problem

satsatisfiability

Score: 0

Answers: 1

Artificial Mind

Reputation: 985

Restricted boolean formulas for avoiding NP-completeness

logicboolean-logicmodel-checkingsatisfiability

Score: 3

Answers: 1

Theo Deep

Reputation: 786

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

z3z3pyquantifiersfirst-order-logicsatisfiability

Score: 0

Answers: 1

sgibbons

Reputation: 3630

Is minimization of boolean expressions NP-Complete?

algorithmcomplexity-theorynp-completesimplificationsatisfiability

Score: 10

Answers: 1

vvg

Reputation: 1213

Specifying modular arithmetic conditions in Z3

z3smtsatisfiability

Score: 0

Answers: 2

Sena j

Reputation: 25

z3 solver using Sympy symbols

pythonsympyz3inequalitysatisfiability

Score: 2

Answers: 1

Theo Deep

Reputation: 786

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

z3z3pyquantifierssatisfiability

Score: 2

Answers: 1

Theo Deep

Reputation: 786

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

z3smtz3pyquantifierssatisfiability

Score: 0

Answers: 1

Theo Deep

Reputation: 786

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

z3smtz3pysatisfiabilitydreal

Score: 1

Answers: 1

fibonacciguy

Reputation: 21

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

optimizationdynamic-programmingsolverminizincsatisfiability

Score: 1

Answers: 1

NightOwl

Reputation: 3

Derivation in the Resolution Proof System

satisfiability2-satisfiabilityproof-system

Score: 0

Answers: 1

Karim Loberg

Reputation: 31

Dimacs cnf expression not satisfiable, why?

satsatisfiabilityconjunctive-normal-form2-satisfiability

Score: 0

Answers: 1

Karim Loberg

Reputation: 31

Satisfiability 3-towers assignment

python-3.xsatisfiabilitysat-solvers

Score: 0

Answers: 1

Rkd

Reputation: 1

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

pythonc++circuitsatsatisfiability

Score: 0

Answers: 2

PreviousPage 1Next

StackOverflow Questions for Tag: satisfiability

Boolean formula encoding

What is the normal procedure of z3 handle axiom with quantifier?

write encodings in Z3 Solver python for string functions like concat

Example of unique 3sat solution

Algorithms with superexponential runtime?

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?

Flip/change satisfiability of SAT problem

Restricted boolean formulas for avoiding NP-completeness

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

Is minimization of boolean expressions NP-Complete?

Specifying modular arithmetic conditions in Z3

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&gt;=2) =&gt; ((y&gt;1) /\ (y&lt;=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

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

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