Login / Signup

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories.

Alessandro CimattiAlberto GriggioRoberto Sebastiani
Published in: SAT (2007)
Keyphrases
  • modulo theories
  • satisfiability modulo theories
  • unsatisfiable cores
  • boolean satisfiability
  • answer set programming
  • max sat
  • satisfiability problem
  • sat solvers
  • sat problem
  • sat instances
  • maximum satisfiability