 | 2012 |
| 30 |  | Matti Järvisalo,
Daniel Le Berre,
Olivier Roussel,
Laurent Simon:
The International SAT Solver Competitions.
AI Magazine 33(1): (2012) |
| 29 |  | Lauri Hella,
Matti Järvisalo,
Antti Kuusisto,
Juhana Laurinharju,
Tuomo Lempiäinen,
Kerkko Luosto,
Jukka Suomela,
Jonni Virtema:
Weak Models of Distributed Computing, with Connections to Modal Logic
CoRR abs/1205.2051: (2012) |
| 2011 |
| 28 |  | Matti Järvisalo:
On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.
CP 2011: 429-437 |
| 27 |  | Anton Belov,
Matti Järvisalo,
Zbigniew Stachniak:
Depth-Driven Circuit-Level Stochastic Local Search for SAT.
IJCAI 2011: 504-509 |
| 26 |  | Matti Järvisalo:
Itemset Mining as a Challenge Application for Answer Set Enumeration.
LPNMR 2011: 304-310 |
| 25 |  | Marijn Heule,
Matti Järvisalo,
Armin Biere:
Efficient CNF Simplification Based on Binary Implication Graphs.
SAT 2011: 201-215 |
| 24 |  | Anton Belov,
Matti Järvisalo:
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
CoRR abs/1109.2049: (2011) |
| 2010 |
| 23 |  | Marijn Heule,
Matti Järvisalo,
Armin Biere:
Clause Elimination Procedures for CNF Formulas.
LPAR (Yogyakarta) 2010: 357-371 |
| 22 |  | Matti Järvisalo,
Armin Biere:
Reconstructing Solutions after Blocked Clause Elimination.
SAT 2010: 340-345 |
| 21 |  | Matti Järvisalo,
Armin Biere,
Marijn Heule:
Blocked Clause Elimination.
TACAS 2010: 129-144 |
| 20 |  | Robert Brummayer,
Matti Järvisalo:
Testing and Debugging Techniques for Answer Set Solver Development
CoRR abs/1007.3223: (2010) |
| 19 |  | Marijn Heule,
Matti Järvisalo,
Armin Biere:
Covered Clause Elimination
CoRR abs/1011.5202: (2010) |
| 18 |  | Robert Brummayer,
Matti Järvisalo:
Testing and debugging techniques for answer set solver development.
TPLP 10(4-6): 741-758 (2010) |
| 2009 |
| 17 |  | Matti Järvisalo,
Emilia Oikarinen,
Tomi Janhunen,
Ilkka Niemelä:
A Module-Based Framework for Multi-language Constraint Modeling.
LPNMR 2009: 155-168 |
| 16 |  | Emilia Oikarinen,
Matti Järvisalo:
Max-ASP: Maximum Satisfiability of Answer Set Programs.
LPNMR 2009: 236-249 |
| 15 |  | Matti Järvisalo:
Structure-based satisfiability checkingAnalyzing and harnessing the potential.
AI Commun. 22(2): 117-119 (2009) |
| 14 |  | Matti Järvisalo,
Tommi A. Junttila:
Limitations of restricted branching in clause learning.
Constraints 14(3): 325-356 (2009) |
| 2008 |
| 13 |  | Matti Järvisalo,
Tommi A. Junttila:
On the Power of Top-Down Branching Heuristics.
AAAI 2008: 304-309 |
| 12 |  | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Non-Clausal Local Search for SAT.
ECAI 2008: 535-539 |
| 11 |  | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Justification-Based Local Search with Adaptive Noise Strategies.
LPAR 2008: 31-46 |
| 10 |  | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP tableaux and rule redundancy in normal logic programs
CoRR abs/0809.3204: (2008) |
| 9 |  | 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) |
| 8 |  | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP Tableaux and rule redundancy in normal logic programs.
TPLP 8(5-6): 691-716 (2008) |
| 2007 |
| 7 |  | Matti Järvisalo,
Tommi A. Junttila:
Limitations of Restricted Branching in Clause Learning.
CP 2007: 348-363 |
| 6 |  | Matti Järvisalo,
Emilia Oikarinen:
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs.
ICLP 2007: 134-148 |
| 2006 |
| 5 |  | Matti Järvisalo:
Further Investigations into Regular XORSAT.
AAAI 2006: 1873-1874 |
| 4 |  | 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 |
| 3 |  | 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 |
| 2 |  | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
AMAI 2004 |
| 1 |  | Matti Järvisalo,
Tommi A. Junttila,
Ilkka Niemelä:
Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
ISAIM 2004 |