Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers

Florian Lonsing, Armin Biere. Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers. Electronic Notes in Theoretical Computer Science, 251:83-95, 2009. [doi]

@article{LonsingB09-0,
  title = {Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers},
  author = {Florian Lonsing and Armin Biere},
  year = {2009},
  doi = {10.1016/j.entcs.2009.08.029},
  url = {http://dx.doi.org/10.1016/j.entcs.2009.08.029},
  tags = {rule-based},
  researchr = {https://researchr.org/publication/LonsingB09-0},
  cites = {0},
  citedby = {0},
  journal = {Electronic Notes in Theoretical Computer Science},
  volume = {251},
  pages = {83-95},
}