An Extensible SAT-solver. - Niklas Eén; Niklas Sörensson (SAT, 2003)

Fair Constraint Merging Tableaux in Lazy Functional Programming Style. - Reiner Hähnle; Niklas Sörensson (TABLEAUX, 2003)

Temporal induction by incremental SAT solving. - Niklas Eén; Niklas Sörensson (BMC@CAV, 2003)

Translating Pseudo-Boolean Constraints into SAT. - Niklas Eén; Niklas Sörensson (J. Satisf. Boolean Model. Comput., 2006)

Applying Logic Synthesis for Speeding Up SAT. - Niklas Eén; Alan Mishchenko; Niklas Sörensson (SAT, 2007)

Minimizing Learned Clauses. - Niklas Sörensson; Armin Biere (SAT, 2009)

SAT-Solving in Practice, with a Tutorial Example from Supervisory Control. - Koen Claessen; Niklas Eén; Mary Sheeran; Niklas Sörensson; Alexey Voronov; Knut Åkesson (Discret. Event Dyn. Syst., 2009)

A liveness checking algorithm that counts. - Koen Claessen; Niklas Sörensson (FMCAD, 2012)