On fixed-parameter tractable parameterizations of SAT
in Theory and Applications of Satisfiability, 6th International Conference, SAT 2003, Selected and Revised Papers, Eds.: E. Giunchiglia and A. Tacchella, Lecture Notes in Computer Science 2919, pp. 188-202, Springer Verlag, 2004.
Download:  [paper ps] [paper pdf]
Abstract:We survey and compare parameterizations of SAT in the framework of Parameterized Complexity (Downey and Fellows, Springer, New York, 1999). In particular, we consider