Satisfiability of Acyclic and almost Acyclic CNF Formulas (II)

Abstract

Full Citation:

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

Stefan Szeider

Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.