|
Tero Laitinen
M.Sc. (Tech.)
Researcher
Research Interest
|
computational logic, Boolean satisfiability problem, satisfiability modulo
theories, parity constraints, answer set programming |
Publications
|
-
Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Extending SAT Solvers with Complete Parity Reasoning. Accepted to ICTAI 2012.
|
|
-
Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Classifying and Propagating Parity Constraints. Accepted to CP 2012.
|
|
-
Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Conflict-driven XOR-clause learning. In SAT 2012, Springer, 2012.
|
|
- Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Equivalence Class Based Parity Reasoning with DPLL(XOR). In ICTAI 2011, IEEE Press, 2011.
|
|
- Tero Laitinen, Tommi Junttila, and Ilkka Niemelä. Extending Clause Learning DPLL with Parity Reasoning. In ECAI 2010, IOE Press, 2010.
|
Software
Teaching
Spring 2012, course assistant,
T-79.3001 Logic in Computer Science: Foundations
Autumn 2011, course assistant,
T-79.5103 Computational Complexity Theory P
Spring 2011, course assistant,
T-79.3001 Logic in Computer Science: Foundations
Autumn 2010, course assistant,
T-79.5103 Computational Complexity Theory P
Spring 2010, course assistant,
T-79.3001 Logic in Computer Science: Foundations
Autumn 2009, course assistant,
T-79.5103 Computational Complexity Theory P
|
|