Login / Signup

Computing Smallest MUSes of Quantified Boolean Formulas.

Andreas NiskanenJere MustonenJeremias BergMatti Järvisalo
Published in: LPNMR (2022)
Keyphrases
  • quantified boolean formulas
  • reasoning tasks
  • universally quantified
  • learning algorithm
  • objective function
  • special case
  • orders of magnitude
  • answer set programming
  • decision procedures
  • propositional satisfiability