Login / Signup

Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas.

Martin BabkaTomás BalyoJaroslav Keznikl
Published in: SERA (selected papers) (2013)
Keyphrases
  • boolean formula
  • decision problems
  • np complete
  • combinatorial optimization
  • optimization problems
  • constraint programming