Stack Overflow
Stack Overflow

Questions tagged [smt]

Satisfiability Modulo Theories (SMT) are decision problems for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality.

Satisfiability Modulo Theories (SMT) are decision problems for logical formulas with respect to combinations of background theories expressed in classical first-order logic with equality.

A SMT instance is a generalization of a Boolean SAT instance in which various sets of variables are replaced by predicates from a variety of underlying theories.

SMT problems are usually expressed by the SMT-LIB language and solved by high-performance SMT solvers. For a list of benchmarks, solvers and other information regarding SMT, please visit http://smtlib.org/.

845 questions
-2
votes
1 answer

How does "minimize" work in Z3

I'm using the minimize function in Z3 a lot and I'm worrying about some scalability issues (when the number of variables I'm minimizing grows). What is the underlying algorithm of "minimize" and is there a general way to speed things up?
Halaby
  • 49
  • 4
-2
votes
1 answer

Reduce the time for multiple modles

It get Multiple Models But It takes hours of time.So Kindly suggest me to reduce the time to get all models.how to get all possible solution for Satisfy equation in less time? Is there any function in z3python for getting all possible solutions in…
praveen gundaram
  • 17
  • 5
-2
votes
1 answer

Verifying properties using Solver

I have a system of equations of the form: x1 * x2 *.... * xn = a, where * can either be + or - . I am building some other equation of the same form, and I want to verify if they are satisfied by the first system. My question is: Is there a solver…
Mr. D
  • 657
  • 1
  • 8
  • 21
-3
votes
1 answer

Integrating Java with Z3

I would like to ask , How to Integrate Java with SMT Z3 solver ? It would be great if there will be described not only theoretical questions, but also some implementation experience.
Shira'H
  • 33
  • 1
-8
votes
1 answer

Is there anyone, who can help me with my smt homework?

Homework: Lab 4 In the second SMT lab exercise (Lab 4) we are going to solve the Chicken McNugget problem with the help of an SMT solver (an instance of the Frobenious Coin Problem). Assume that a fast food chain sells boxes with fried chicken…
user12793973
1 2 3
…
56
57