2009 |
|
34 | Emilia Oikarinen and Matti Järvisalo. Max-ASP: Maximum satisfiability of answer set programs. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Computer Science, pages 236–249. Springer, 2009. |
|
|
33 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Esra Erdem, Fangzhen Lin, and Torsten Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009), volume 5753 of Lecture Notes in Computer Science, pages 155–169. Springer, 2009. |
|
|
32 | Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä. A module-based framework for multi-language constraint modeling. In Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009), 2009. |
|
|
31 | Matti Järvisalo. Structure-based satisfiability checking: Analyzing and harnessing the potential. AI Communications, 22(2):117–119, 2009. Thesis summary. |
|
|
30 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. Constraints, 14(3):325–356, 2009. |
|
2008 |
|
29 | Matti Järvisalo. Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential. Doctoral dissertation. Volume TKK-ICS-D10 of TKK Dissertations in Information and Computer Science, Helsinki University of Technology, Faculty of Information and Natural Sciences, Department of Information and Computer Science, Espoo, Finland, 2008. ISBN 978-951-22-9641-5 (print) / ISBN 978-951-22-9642-2 (online). |
|
|
28 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. Theory and Practice of Logic Programming, 8(5–6):691–716, 2008. |
|
|
27 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Computer Science, pages 31–46. Springer, 2008. |
|
|
26 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based local search with adaptive noise strategies. In Proceedings of the 2nd International Workshop on Logic and Search: Computation of structures from declarative descriptions (LaSh'08), pages 111–125. KU Leuven, 2008. |
|
|
25 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Justification-based non-clausal local search for SAT. In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fanotakis, and Nikos Avoukis, editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), volume 178 of Frontiers in Artificial Intelligence and Applications, pages 535–539. IOS Press, 2008. |
|
|
24 | Matti Järvisalo and Tommi Junttila. On the power of top-down branching heuristics. In Dieter Fox and Carla P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-08), pages 304–309. AAAI Press, 2008. |
|
|
23 | Matti Järvisalo and Ilkka Niemelä. The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. Journal of Algorithms, 63(1–3):90–113, 2008. |
|
2007 |
|
22 | Matti Järvisalo. Impact of restricted branching on clause learning SAT solving. Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2007. ISBN 978-951-22-8907-3. |
|
|
21 | Matti Järvisalo. Restricted branching in clause learning DPLL. In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Program, pages 55–60, 2007. |
|
|
20 | Matti Järvisalo and Tommi Junttila. Limitations of restricted branching in clause learning. In Christian Bessiere, editor, Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP 2007), volume 4741 of Lecture Notes in Computer Science, pages 348–363. Springer, 2007. |
|
|
19 | Matti Järvisalo. Equivalence checking hardware multiplier designs, 2007. SAT Competition 2007 benchmark description. Available at http://www.satcompetition.org/2007/contestants.html. |
|
|
18 | Matti Järvisalo. The effect of structural branching on the efficiency of clause learning SAT solving. In 14th RCRA Workshop: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007. See http://pst.istc.cnr.it/RCRA07/program.html. |
|
|
17 | Matti Järvisalo. Industrial-strength SAT solving and restricted branching. In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Abstract proceedings, Series of Publications B, Report B-2007-4, page 39. Helsinki University Printing House, 2007. |
|
|
16 | Matti Järvisalo. Impact of Restricted Branching on Clause Learning SAT Solving. Licentiate's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, 2007. |
|
|
15 | Matti Järvisalo and Emilia Oikarinen. Extended ASP tableaux and rule redundancy in normal logic programs. In Verónica Dahl and Ilkka Niemelä, editors, Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007), volume 4670 of Lecture Notes in Computer Science, pages 134–148. Springer, 2007. |
|
2006 |
|
14 | Matti Järvisalo. drgen — regular  -XORSAT generator, February 2006. Computer program. |
|
|
13 | Matti Järvisalo. Further investigations into regular XORSAT. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06), pages 1873–1874. AAAI Press, 2006. Poster. |
|
|
12 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):27–46, 2006. |
|
|
11 | Matti Järvisalo. Opinions, hopes, and expectations of CS&E students, a case study in academic skills and hidden curriculum. In Tapio Salakoski, Tomi Mäntylä, and Mikko Laakso, editors, Koli Calling 2005 – Proceedings of the Fifth Finnish / Baltic Sea Conference on Computer Science Education, volume 41 of TUCS General Publications, pages 157–161. Turku Centre for Computer Science, 2006. ISBN 951-29-3006-4. |
|
2005 |
|
10 | Matti Järvisalo. rgen — a SAT benchmark generator, September 2005. Computer program. |
|
|
9 | Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä. SAT benchmarks based on 3-regular graphs, 2005. SAT Competition 2005 benchmark description. Benchmark set available at http://www.tcs.hut.fi/%7Emjj/benchmarks/. SAT Competition 2005 results available through http://www.satcompetition.org/2005/. |
|
|
8 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. Annals of Mathematics and Artificial Intelligence, 44(4):373–399, 2005. |
|
2004 |
|
7 | Matti Järvisalo. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa. Tietojenkäsittelytiede, 22:47–63, 2004. In Finnish. |
|
|
6 | Tomi Janhunen, Toni Jussila, Matti Järvisalo, and Emilia Oikarinen. Teaching Smullyan's analytic tableaux in a scalable learning environment. In Ari Korhonen and Lauri Malmi, editors, Kolin Kolistelut – Koli Calling. Proceedings of the Fourth Finnish / Baltic Sea Conference on Computer Science Education, volume TKO-42/04 of Research Report Series of Laboratory of Information Processing Science, Helsinki University of Technology, pages 85–94. Otamedia, 2004. |
|
|
5 | Matti Järvisalo and Ilkka Niemelä. A compact reformulation of propositional satisfiability as binary constraint satisfaction. In Alan M. Frisch and Ian Miguel, editors, Proceedings of the 3rd International Workshop on Modelling and Reformulating Constraint Satisfaction Problems: Towards Systemisation and Automation, pages 111–124, 2004. Proceedings available at http://www-users.cs.york.ac.uk/%7Efrisch/Reformulation/04/. |
|
|
4 | Matti Järvisalo. Todistuskompleksisuudesta Boolen piirien toteutuvuustarkastuksessa. In Pasi Fränti and Esko Marjomaa, editors, Tietojenkäsittelytieteen päivät 2004, volume 5 of International Proceedings Series of Department of Computer Science, University of Joensuu, pages 49–53. Joensuun yliopisto, 2004. In Finnish. |
|
|
3 | Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Research Report A90, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. ISBN 951-22-7020-X. |
|
|
2 | Matti Järvisalo. Proof complexity of cut-based tableaux for Boolean circuit satisfiability checking. Master's thesis, Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, 2004. |
|
|
1 | Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä. Unrestricted vs restricted cut in a tableau method for Boolean circuits. In 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, Florida, USA, January 4–6, 2004. Proceedings available at http://rutcor.rutgers.edu/%7Eamai/aimath04/. |
|
