( en | de | ru )

 

Disambiguation of "Junttila, Tommi A."

Author of the publication

copydeleteadd this publication to your clipboard
An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.

, , , , , , and . TACAS, volume 3440 of Lecture Notes in Computer Science, page 317-333. Springer, (2005)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tommi Kramer

Tommi Mendel

Tommi Mononen

Tommi Tykkälä

Tommi Rimpiläinen

 

Other publications of authors with the same name

Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking., and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 553-567. Springer, (2000)Strategies for Solving SAT in Grids by Randomized Search., , and . AISC/MKM/Calculemus, volume 5144 of Lecture Notes in Computer Science, page 125-140. Springer, (2008)The MathSAT 3 System., , , , , , and . CADE, volume 3632 of Lecture Notes in Computer Science, page 315-321. Springer, (2005)Extending Clause Learning SAT Solvers with Complete Parity Reasoning., , and . ICTAI, page 65-72. IEEE Computer Society, (2012)Partitioning Search Spaces of a Randomized Search., , and . Fundam. Informaticae, 107 (2-3): 289-311 (2011)Efficient model checking of PSL safety properties., , and . IET Comput. Digit. Tech., 5 (6): 479-492 (2011)Conflict-Driven XOR-Clause Learning., , and . SAT, volume 7317 of Lecture Notes in Computer Science, page 383-396. Springer, (2012)An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic., , , , , , and . TACAS, volume 3440 of Lecture Notes in Computer Science, page 317-333. Springer, (2005)Efficient Satisfiability Modulo Theories via Delayed Theory Combination., , , , , , and . CAV, volume 3576 of Lecture Notes in Computer Science, page 335-349. Springer, (2005)Non-Clausal SAT and ATPG., , and . Handbook of Satisfiability, volume 336 of Frontiers in Artificial Intelligence and Applications, IOS Press, (2021)