Satisfiability of Acyclic and Almost Acyclic CNF Formulas

Ordyniak, Sebastian; Paulusma, Daniël; Szeider, Stefan

by Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Reference:

Satisfiability of Acyclic and Almost Acyclic CNF FormulasSebastian Ordyniak, Daniël Paulusma, Stefan SzeiderIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India (Kamal Lodaya, Meena Mahajan, eds.), volume 8 of LIPIcs, pages 84-95, 2010, Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@string{lzi="Leibniz-Zentrum fuer Informatik"}
@string{lipics="LIPIcs"}
@inproceedings{OrdyniakPaulusmaSzeider10,
  author    = {Sebastian Ordyniak and
               Dani{\"e}l Paulusma and
               Stefan Szeider},
  title     = {Satisfiability of Acyclic and Almost Acyclic {CNF} Formulas},
  pages     = {84-95},
  editor    = {Kamal Lodaya and
               Meena Mahajan},
  booktitle     = {IARCS Annual Conference on Foundations of Software Technology
               and Theoretical Computer Science, FSTTCS 2010, December
               15-18, 2010, Chennai, India},
  publisher = LZI,
  series    = LIPIcs,
  volume    = {8},
  year      = {2010},
}