Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

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

doi:10.1007/978-3-642-21581-0_6

by Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider

Reference:

Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)Sebastian Ordyniak, Daniël Paulusma, Stefan SzeiderTheory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings (Karem A. Sakallah, Laurent Simon, eds.), volume 6695 of Lecture Notes in Computer Science, pages 47-60, 2011, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{OrdyniakPaulusmaSzeider11,
  author    = {Sebastian Ordyniak and Dani{\"{e}}l Paulusma and Stefan
                  Szeider},
  title     = {Satisfiability of Acyclic and almost Acyclic {CNF}
                  Formulas {(II)}},
  booktitle = {Theory and Applications of Satisfiability Testing -
                  {SAT} 2011 - 14th International Conference, {SAT}
                  2011, Ann Arbor, MI, USA, June 19-22,
                  2011. Proceedings},
  pages     = {47-60},
  year      = {2011},
  doi       = {10.1007/978-3-642-21581-0_6},
  editor    = {Karem A. Sakallah and
               Laurent Simon},
  series    = LNCS,
  volume    = {6695},
  publisher = Springer,
}