QMusExt: A Minimal (Un)satisfiable Core Extractor for Quantified Boolean Formulas.

Andreas Plank Martina Seidl

Published in: SAT (2023)

Keyphrases

quantified boolean formulas
decision procedures
propositional satisfiability
sat instances
randomly generated
sat problem
reasoning tasks
satisfiability problem
np complete
phase transition
description logics
orders of magnitude
conjunctive queries
propositional logic
boolean formula