Login / Signup

TACO: Efficient SAT-Based Bounded Verification Using Symmetry Breaking and Tight Bounds.

Juan P. GaleottiNicolás RosnerCarlos Gustavo López PomboMarcelo F. Frias
Published in: IEEE Trans. Software Eng. (2013)
Keyphrases
  • tight bounds
  • symmetry breaking
  • upper bound
  • boolean satisfiability
  • sat solvers
  • constraint programming
  • query processing
  • special case
  • orders of magnitude
  • model checking
  • planning problems
  • answer set programming