Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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

This author has not been identified. Look up 'Sebastian Ordyniak' in GoogleThis author has not been identified. Look up 'Daniël Paulusma' in GoogleThis author has not been identified. Look up 'Stefan Szeider' in Google

runs on WebDSL