An AIG-Based QBF-solver using SAT for preprocessing.
Florian PigorschChristoph SchollPublished in: DAC (2010)
Keyphrases
- preprocessing
- quantified boolean formulas
- boolean formula
- propositional satisfiability
- sat solvers
- sat solving
- boolean satisfiability
- conjunctive normal form
- sat problem
- unit propagation
- constraint programming
- propositional logic
- np complete
- automated reasoning
- sat instances
- preprocessing phase
- practical problems
- boolean variables
- linear constraints
- feature extraction
- reasoning tasks
- davis putnam
- max sat
- decision procedures
- quantified boolean formulae
- satisfiability problem
- membership queries
- industrial applications
- feature selection algorithms
- boolean functions
- phase transition
- clause learning
- orders of magnitude
- preprocessing stage
- description logics
- answer set programming