Computing Resolution-Path Dependencies in Linear Time

Abstract

Full Citation:

Friedrich Slivovsky, Stefan Szeider. Computing Resolution-Path Dependencies in Linear Time. Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings (Alessandro Cimatti and Roberto Sebastiani), volume 7317 of Lecture Notes in Computer Science, pages 58-71, 2012, Springer Verlag.

Stefan Szeider

Head of Research Unit

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