| 2008 |
|---|
| 12 | | Matti Järvisalo,
Tommi A. Junttila:
On the Power of Top-Down Branching Heuristics.
AAAI 2008: 304-309 |
| 11 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT.
ECAI 2008: 535-539 |
| 10 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies.
LPAR 2008: 31-46 |
| 9 | EE | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP tableaux and rule redundancy in normal logic programs
CoRR abs/0809.3204: (2008) |
| 8 | EE | Matti Järvisalo,
Ilkka Niemelä:
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study.
J. Algorithms 63(1-3): 90-113 (2008) |
| 7 | EE | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP Tableaux and rule redundancy in normal logic programs.
TPLP 8(5-6): 691-716 (2008) |
| 2007 |
|---|
| 6 | EE | Matti Järvisalo,
Tommi A. Junttila:
Limitations of Restricted Branching in Clause Learning.
CP 2007: 348-363 |
| 5 | EE | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs.
ICLP 2007: 134-148 |
| 2006 |
|---|
| 4 | | Matti Järvisalo:
Further Investigations into Regular XORSAT.
AAAI 2006 |
| 3 | EE | Harri Haanpää,
Matti Järvisalo,
Petteri Kaski,
Ilkka Niemelä:
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
JSAT 2(1-4): 27-46 (2006) |
| 2005 |
|---|
| 2 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs restricted cut in a tableau method for Boolean circuits.
Ann. Math. Artif. Intell. 44(4): 373-399 (2005) |
| 2004 |
|---|
| 1 | EE | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
AMAI 2004 |
