An AIG-based QBF-solver using SAT for preprocessing

@article{Pigorsch2010AnAQ,
  title={An AIG-based QBF-solver using SAT for preprocessing},
  author={Florian Pigorsch and Christoph Scholl},
  journal={Design Automation Conference},
  year={2010},
  pages={170-175}
}
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which heuristically combines cofactor-based quantifier elimination with quantification using BDDs and thus benefits from the strengths of both data structures. Moreover, we present a novel SAT-based method for preprocessing QBFs that is able to efficiently detect variables with forced truth assignments, allowing for an… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS

Solving DQBF through quantifier elimination

  • 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE)
  • 2015
VIEW 6 EXCERPTS
CITES METHODS

Failed Literal Detection for QBF

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

The QBF Solver AIGSolve

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS

Integration of orthogonal QBF solving techniques

  • 2011 Design, Automation & Test in Europe
  • 2011
VIEW 4 EXCERPTS
CITES METHODS

Enhanced Unsatisfiable Cores for QBF: Weakening Universal to Existential Quantifiers

  • 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)
  • 2018

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES