Niklas Sörensson

According to our database, Niklas Sörensson authored at least 8 papers between 2003 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2012

A liveness checking algorithm that counts.

Koen Claessen, Niklas Sörensson

Proceedings of the Formal Methods in Computer-Aided Design, 2012

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

Minimizing Learned Clauses.

Niklas Sörensson, Armin Biere

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2007

Applying Logic Synthesis for Speeding Up SAT.

Niklas Eén, Alan Mishchenko, Niklas Sörensson

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

2006

Translating Pseudo-Boolean Constraints into SAT.

Niklas Eén, Niklas Sörensson

J. Satisf. Boolean Model. Comput., 2006

2003

Temporal induction by incremental SAT solving.

Niklas Eén, Niklas Sörensson

Proceedings of the First International Workshop on Bounded Model Checking, 2003

Fair Constraint Merging Tableaux in Lazy Functional Programming Style.

Reiner Hähnle, Niklas Sörensson

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2003

An Extensible SAT-solver.

Niklas Eén, Niklas Sörensson

Proceedings of the Theory and Applications of Satisfiability Testing, 2003