Publications by Matti Järvisalo

[Journals] [Conferences] [Workshops] [Edited Volumes] [Theses] [Other]

This list is also available sorted by year.

In International Journals

  1. Empirical Hardness of Finding Optimal Bayesian Network Structures: Algorithm Selection and Runtime Prediction.
    Brandon Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, and Petri Myllymäki.
    Machine Learning, accepted for publication (2017).
    [doi:???] [pdf] [abstract/bibtex]

  2. A Constraint Optimization Approach to Causal Discovery from Subsampled Time Series Data.
    Antti Hyttinen, Sergey M. Plis, Matti Järvisalo, Frederick Eberhardt, and David Danks.
    International Journal of Approximate Reasoning, accepted for publication (2017).
    [doi:10.1016/j.ijar.2017.07.009] [pdf] [abstract/bibtex]

  3. Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.
    Johannes P. Wallner, Andreas Niskanen, and Matti Järvisalo.
    Journal of Artificial Intelligence Research, accepted for publication (2017).
    [doi:???] [pdf] [abstract/bibtex]

  4. Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity.
    James Cussens, Matti Järvisalo, Janne H. Korhonen, and Mark Bartlett.
    Journal of Artificial Intelligence Research 58:185-229, 2017.
    [doi:10.1613/jair.5203] [pdf] [abstract/bibtex]

  5. Cost-Optimal Constrained Correlation Clustering via Weighted Partial Maximum Satisfiability.
    Jeremias Berg and Matti Järvisalo.
    Artificial Intelligence 244:110-142, 2017.
    [doi:10.1016/j.artint.2015.07.001] Preliminary version: [pdf] [abstract/bibtex]

  6. Separating OR, SUM, and XOR circuits.
    Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen.
    Journal of Computer and System Sciences 82(5):793-801, 2016.
    [doi:10.1016/j.jcss.2016.01.001] Preliminary version: [pdf] [abstract/bibtex]

  7. Synchronous Counting and Computational Algorithm Design.
    Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, and Siert Wieringa.
    Journal of Computer and System Sciences 82(2):310-332, 2016.
    [doi:10.1016/j.jcss.2015.09.002] Preliminary version: [pdf] [abstract/bibtex]

  8. Clause Elimination for SAT and QSAT.
    Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, and Armin Biere.
    Journal of Artificial Intelligence Research 53:127-168, 2015.
    [doi:10.1613/jair.4694] [pdf] [abstract/bibtex]

  9. Overview and Analysis of the SAT Challenge 2012 Solver Competition.
    Adrian Balint, Anton Belov, Matti Järvisalo, and Carsten Sinz.
    Artificial Intelligence 223:120-155, 2015.
    [doi:10.1016/j.artint.2015.01.002] Preliminary version: [pdf] [abstract/bibtex]

  10. Weak Models of Distributed Computing, with Connections to Modal Logic.
    Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, and Jonni Virtema.
    Distributed Computing 28(1):31-53, 2015.
    [doi:10.1007/s00446-013-0202-3] [pdf] [abstract/bibtex]

  11. Complexity-Sensitive Decision Procedures for Abstract Argumentation.
    Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
    Artificial Intelligence 206:53-78, 2014.
    [doi:10.1016/j.artint.2013.10.001] Preliminary version: [pdf] [abstract/bibtex]

  12. Simulating Circuit-Level Simplifications on CNF.
    Matti Järvisalo, Armin Biere, and Marijn J.H. Heule.
    Journal of Automated Reasoning 49(4):583-619, 2012.
    [doi:10.1007/s10817-011-9239-9] Preliminary version: [pdf] [abstract/bibtex]

  13. The International SAT Solver Competitions.
    Matti Järvisalo, Daniel Le Berre, Olivier Roussel, and Laurent Simon.
    AI Magazine 33(1):89-92, 2012.
    [Publisher's copy] Preliminary version: [pdf] [abstract/bibtex]

  14. Testing and Debugging Techniques for Answer Set Solver Development.
    Robert Brummayer and Matti Järvisalo.
    Theory and Practice of Logic Programming 10(4-6):741-758, 2010.
    [doi:10.1017/S1471068410000396] Preliminary version: [arXiv:cs.AI/1007.3223] [pdf] [abstract/bibtex]

  15. Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential.
    Matti Järvisalo.
    AI Communications 22(2):117-119, 2009.
    [doi:10.3233/AIC-2009-0445] [pdf] [abstract/bibtex]

  16. Limitations of Restricted Branching in Clause Learning.
    Matti Järvisalo and Tommi Junttila.
    Constraints 14(3):325-356, 2009.
    [doi:10.1007/s10601-008-9062-z] [pdf] [abstract/bibtex]

  17. Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs.
    Matti Järvisalo and Emilia Oikarinen.
    Theory and Practice of Logic Programming 8(5-6):691-716, 2008.
    [doi:10.1017/S1471068408003578] Preliminary version: [arXiv:cs.AI/0809.3204] [pdf] [abstract/bibtex]

  18. The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving: An Experimental Study.
    Matti Järvisalo and Ilkka Niemelä.
    Journal of Algorithms 63(1-3):90-113, 2008.
    [doi:10.1016/j.jalgor.2008.02.005] [pdf] [abstract/bibtex]

  19. Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques.
    Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä.
    Journal on Satisfiability, Boolean Modeling and Computation 2(1-4):27-46, 2006.
    [Publisher's copy] [pdf] [abstract/bibtex]

  20. Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
    Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä.
    Annals of Mathematics and Artificial Intelligence 44(4):373-399, 2005.
    [doi:10.1007/s10472-005-7034-1] [pdf] [abstract/bibtex]

In Peer-Reviewed International Conferences

  1. Improving MCS Enumeration via Caching.
    Alessandro Previti, Carlos Mencia, Matti Järvisalo, and Joao Marques-Silva.
    In Serge Gaspers and Toby Walsh, editors, Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017), volume 10491 of Lecture Notes in Computer Science, pages ???-???. Springer, 2017.
    [doi:???] [pdf] [abstract/bibtex]

  2. MaxPre: An Extended MaxSAT Preprocessor.
    Tuukka Korhonen, Jeremias Berg, Paul Saikko, and Matti Järvisalo.
    In Serge Gaspers and Toby Walsh, editors, Proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing (SAT 2017), volume 10491 of Lecture Notes in Computer Science, pages ???-???. Springer, 2017.
    [doi:???] [pdf] [abstract/bibtex]

  3. Weight-Aware Core Extraction in SAT-Based MaxSAT Solving.
    Jeremias Berg and Matti Järvisalo.
    In ???, editors, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume ????? of Lecture Notes in Computer Science, pages ???-???. Springer, 2017.
    [doi:???] [pdf] [abstract/bibtex]

  4. Reduced Cost Fixing in MaxSAT.
    Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko.
    In ???, editors, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume ????? of Lecture Notes in Computer Science, pages ???-???. Springer, 2017.
    [doi:???] [pdf] [abstract/bibtex]
    [CP 2017 Distinguished Paper Award]

  5. Minimum-Width Confidence Bands via Constraint Optimization.
    Jeremias Berg, Emilia Oikarinen, Matti Järvisalo, and Kai Puolamäki.
    In ???, editors, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume ????? of Lecture Notes in Computer Science, pages ???-???. Springer, 2017.
    [doi:???] [pdf] [abstract/bibtex]

  6. A Core-Guided Approach to Learning Optimal Causal Graphs.
    Antti Hyttinen, Paul Saikko, and Matti Järvisalo.
    In Carles Sierra, editors, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 645--651. IJCAI, 2017.
    [Publisher's version] [pdf] [abstract/bibtex]

  7. Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract).
    James Cussens, Matti Järvisalo, Janne H. Korhonen, and Mark Bartlett.
    In Carles Sierra, editors, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 4990-4994. IJCAI, 2017.
    [Publisher's version] [pdf] [abstract/bibtex]

  8. From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning.
    Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
    in Alessandro Antonucci, Laurence Cholvy, and Odile Papini, editors, Proceedings ofthe 14th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2017), volume 10369 of Lecture Notes in Computer Science, pages 57-68. Springer, 2017.
    [doi:10.1007/978-3-319-61581-3_6] [pdf] [abstract/bibtex]

  9. Pakota: A System for Enforcement in Abstract Argumentation.
    Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
    In  Loizos Michael and Antonis C. Kakas, editors, Proceedings of the 15th European Conference on Logics in Artificial Intelligence (JELIA 2016), volume 10021 of Lecture Notes in Computer Science, pages 385-400. Springer, 2016.
    [doi:10.1007/978-3-319-48758-8_25] [pdf] [abstract/bibtex]

  10. Causal Discovery from Subsampled Time Series Data by Constraint Optimization.
    Antti Hyttinen, Sergey M. Plis, Matti Järvisalo, Frederick Eberhardt, and David Danks.
    In Alessandro Antonucci, Giorgio Corani, and Cassio Polpo de Campos, editors, Proceedings of the 8th International Conference on Probabilistic Graphical Models (PGM 2016), volume 52 of JMLR Workshop and Conference Proceedings, pages 216-227. JMLR.org, 2016.
    [Publisher's version] [pdf] [abstract/bibtex]

  11. Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving.
    Jeremias Berg and Matti Järvisalo.
    In Michel Rueher, editors, Proceedings of the 22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), volume 9892 of Lecture Notes in Computer Science, pages 66-85. Springer, 2016.
    [doi:10.1007/978-3-319-44953-1_5] [pdf] [abstract/bibtex]

  12. Subsumed Label Elimination for Maximum Satisfiability.
    Jeremias Berg, Paul Saikko, and Matti Järvisalo.
    In Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, and Frank van Harmelen, editors, Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 630-638. IOS Press, 2016.
    [doi:10.3233/978-1-61499-672-9-630] [pdf] [abstract/bibtex]

  13. Synthesizing Argumentation Frameworks from Examples.
    Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
    In Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, and Frank van Harmelen, editors, Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, pages 551-559. IOS Press, 2016.
    [doi:10.3233/978-1-61499-672-9-551] [pdf] [abstract/bibtex]
    [ECAI 2016 Runner-up Best Student Paper Award]

  14. Optimal Status Enforcement in Abstract Argumentation.
    Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
    In Subbarao Kambhampati, editor, Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 1216-1222. AAAI Press, 2016.
    [Publisher's version] [pdf] [abstract/bibtex]

  15. LMHS: A SAT-IP Hybrid MaxSAT Solver.
    Paul Saikko, Jeremias Berg, and Matti Järvisalo.
    In Nadia Creignou and Daniel Le Berre, editors, Proceedings of the 19th International Conference on Theory and Applications of Satisfiability Testing (SAT 2016), volume 9710 of Lecture Notes in Computer Science, pages 539-546. Springer, 2016.
    [doi:10.1007/978-3-319-40970-2_34] [pdf] [abstract/bibtex]

  16. Implicit Hitting Set Algorithms for Reasoning Beyond NP
    Paul Saikko, Johannes P. Wallner, and Matti Järvisalo.
    In Chitta Baral and James P. Delgrande and Frank Wolter, editors, Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pages 104-113. AAAI Press, 2016.
    [Publisher's version] Extended version with proofs: [pdf] [abstract/bibtex]

  17. Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.
    Johannes P. Wallner, Andreas Niskanen, and Matti Järvisalo.
    In Dale Schuurmans and Michael Wellman, editors, Proceedings of the 30th AAAI Conference on Artificial Intelligence (AAAI 2016), pages 1088-1094. AAAI Press, 2016.
    [Publisher's version] [pdf] [abstract/bibtex]

  18. Re-using Auxiliary Variables for MaxSAT Preprocessing.
    Jeremias Berg, Paul Saikko, and Matti Järvisalo.
    In Proceedings of the IEEE 27th International Conference on Tools with Artificial Intelligence (ICTAI 2015), pages 813-820. IEEE Computer Society, 2015.
    [doi:10.1109/ICTAI.2015.120] [pdf] [abstract/bibtex]

  19. Do-calculus when the True Graph is Unknown.
    Antti Hyttinen, Frederick Eberhardt, and Matti Järvisalo.
    In Tom Heskes and Marina Meila, editors, Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI 2015), pages 395-404. AUAI Press, 2015.
    [Publisher's version] [pdf] [abstract/bibtex]

  20. Learning Optimal Chain Graphs with Answer Set Programming.
    Dag Sonntag, Matti Järvisalo, Jose M. Peña, and Antti Hyttinen.
    In Tom Heskes and Marina Meila, editors, Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI 2015), pages 822-831. AUAI Press, 2015.
    [Publisher's version] [pdf] [abstract/bibtex]

  21. Impact of Learning Strategies on the Quality of Bayesian Networks: An Empirical Evaluation.
    Brandon Malone, Matti Järvisalo, and Petri Myllymäki.
    In Tom Heskes and Marina Meila, editors, Proceedings of the 31st Conference on Uncertainty in Artificial Intelligence (UAI 2015), pages 362-371. AUAI Press, 2015.
    [Publisher's version] [pdf] [abstract/bibtex]

  22. Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT.
    Jeremias Berg, Paul Saikko, and Matti Järvisalo.
    In Qiang Yang and Michael Wooldridge, editors, Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 239-245. AAAI Press, 2015.
    [Publisher's version] Local copy: [pdf] [abstract/bibtex]

  23. Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract).
    Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
    In Qiang Yang and Michael Wooldridge, editors, Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pages 4073-4077. AAAI Press, 2015.
    [Publisher's version] [abstract/bibtex]

  24. MaxSAT-Based Cutting Planes for Learning Graphical Models.
    Paul Saikko, Brandon Malone, and Matti Järvisalo.
    In Laurent Michel, editor, Proceedings of the 12th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2015), volume 9075 of Lecture Notes in Computer Science, pages 345-354. Springer, 2015.
    [doi:10.1007/978-3-319-18008-3_24] [pdf] [abstract/bibtex]

  25. Applications of MaxSAT in Data Analysis.
    Jeremias Berg, Antti Hyttinen, and Matti Järvisalo.
    In ???, editors, Proceedings of the 6th Pragmatics of SAT Workshop (PoS 2015), volume ?? of Easychair Proceedings in Computing, pages ??-??. Easychair, 2015.
    [pdf] [abstract/bibtex]

  26. SAT-Based Approaches to Treewidth Computation: An Evaluation.
    Jeremias Berg and Matti Järvisalo.
    In Proceedings of the 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI 2014), pages 328-335. IEEE Computer Society, 2014.
    [doi:10.1109/ICTAI.2014.57] [pdf] [abstract/bibtex]

  27. Answer Set Solver Backdoors.
    Emilia Oikarinen and Matti Järvisalo.
    In Eduardo Ferme and Joao Leite, editors, Proceedings of the 14th International Conference on Logics in Artificial Intelligence (JELIA 2014), volume 8761 of Lecture Notes in Computer Science, pages 674-683. Springer, 2014.
    [doi:10.1007/978-3-319-11558-0_51] [pdf] [abstract/bibtex]

  28. Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming.
    Antti Hyttinen, Frederick Eberhardt, and Matti Järvisalo.
    In Jin Tian and Nevin L. Zhang, editors, Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence (UAI 2014), pages 340-349. AUAI Press, 2014.
    [pdf] [abstract/bibtex]

  29. Optimal Neighborhood Preserving Visualization by Maximum Satisfiability.
    Kerstin Bunte, Matti Järvisalo, Jeremias Berg, Petri Myllymäki, Jaakko Peltonen, and Samuel Kaski.
    In Carla E. Brodley and Peter Stone, editors, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 1694-1700. AAAI Press, 2014.
    [Publisher's version] [pdf] [abstract/bibtex]

  30. Predicting the Hardness of Learning Bayesian Networks.
    Brandon Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, and Petri Myllymäki.
    In Carla E. Brodley and Peter Stone, editors, Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 2460-2466. AAAI Press, 2014.
    [Publisher's version] [pdf] [abstract/bibtex]

  31. Conditional Lower Bounds for Failed Literals and Related Techniques.
    Matti Järvisalo and Janne H. Korhonen.
    In Uwe Egly and Carsten Sinz, editors, Proceedings of the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT 2014), volume 8561 of Lecture Notes in Computer Science, pages 75-84. Springer, 2014.
    [doi:10.1007/978-3-319-09284-3_7] [pdf] [abstract/bibtex]

  32. Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability.
    Jeremias Berg, Matti Järvisalo, and Brandon Malone.
    In Jukka Corander and Samuel Kaski, editors, Proceedings of the 17th International Conference on Artificial Intelligence and Statistics (AISTATS 2014), volume 33 of JMLR Workshop and Conference Proceedings, pages 86-95. JMLR, 2014.
    [Publisher's version] [pdf] [abstract/bibtex]

  33. Optimal Correlation Clustering via MaxSAT.
    Jeremias Berg and Matti Järvisalo.
    In Wei Ding, Takashi Washio, Hui Xiong, George Karypis, Bhavani M. Thuraisingham, Diane J. Cook and Xindong Wu, editors, Proceedings of the 2013 IEEE 13th International Conference on Data Mining Workshops (ICDMW 2013), pages 750-757, IEEE Computer Society, 2013.
    [doi:10.1109/ICDMW.2013.99] [pdf] [abstract/bibtex]

  34. Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure.
    Antti Hyttinen, Patrik Hoyer, Frederick Eberhardt, and Matti Järvisalo.
    In Ann Nicholson and Padhraic Smyth, editors, Proceedings of the 29th Conference on Uncertainty in Artificial Intelligence (UAI 2013), pages 301-310. AUAI Press, 2013.
    [Publisher's version] [pdf] [abstract/bibtex]

  35. Formula Preprocessing in MUS Extraction.
    Anton Belov, Matti Järvisalo, and Joao Marques-Silva.
    In Nir Piterman and Scott Smolka, editors, Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2013), volume 7795 of Lecture Notes in Computer Science, pages 110-125. Springer, 2013.
    [doi:10.1007/978-3-642-36742-7_8] Preliminary version: [pdf] [abstract/bibtex]

  36. Revisiting Hyper Binary Resolution.
    Marijn Heule, Matti Järvisalo, and Armin Biere.
    In Carla Gomes and Meinolf Sellmann, editors, Proceedings of the 10th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming (CPAIOR 2013), volume 7974 of Lecture Notes in Computer Science, pages 77-93. Springer, 2013.
    [doi:10.1007/978-3-642-38171-3_6] Preliminary version: [pdf] [abstract/bibtex]

  37. Harnessing Constraint Programming for Poetry Composition.
    Jukka M. Toivanen, Matti Järvisalo, and Hannu Toivonen.
    In Mary Lou Maher, Tony Veale, Rob Saunders, and Oliver Bown, editors, Proceedings of the 4th International Conference on Computational Creativity (ICCC 2013), pages 160-167. The University of Sydney, 2013.
    [pdf] [abstract/bibtex]

  38. Covered Clause Elimination.
    Marijn Heule, Matti Järvisalo, and Armin Biere.
    In Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz, and Christian Fermüller, editors, Short Paper Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-17 / 2010), volume 13 of EasyChair Proceedings in Computing, pages 41-46, 2013.
    Preliminary version: [arXiv:cs.LO/1011.5202] [pdf] [abstract/bibtex]

  39. Relating Proof Complexity Measures and Practical Hardness of SAT.
    Matti Järvisalo, Arie Matsliah, Jakob Nordström, and Stanislav Živný.
    In Michela Milano, editor, Proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP 2012), volume 7514 of Lecture Notes in Computer Science (LNCS), pages 316-331. Springer, 2012.
    [doi:10.1007/978-3-642-33558-7_25] Preliminary version: [pdf] [abstract/bibtex]

  40. Inprocessing Rules.
    Matti Järvisalo, Marijn Heule, and Armin Biere.
    In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Proceedings of the 6th International Joint Conference on Automated Reasoning (IJCAR 2012), volume 7364 of Lecture Notes in Computer Science (LNCS/LNAI), pages 355-370. Springer, 2012.
    [doi:10.1007/978-3-642-31365-3_28] Preliminary version: [pdf] [abstract/bibtex]

  41. Complexity-Sensitive Decision Procedures for Abstract Argumentation.
    Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
    In Thomas Eiter and Sheila McIlraith, editors, Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pages 54-64. AAAI Press, 2012.
    [KR 2012 Distinguished Student Paper Prize]
    [Publisher's version] Local copy: [pdf] [abstract/bibtex]

  42. Finding Efficient Circuits for Ensemble Computation.
    Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen.
    In Alessandro Cimatti and Roberto Sebastiani, editors, Proceedings of the 15th International Conference on Theory and Applications of Satisfiability Testing (SAT 2012), volume 7317 of Lecture Notes in Computer Science, pages 369-382. Springer, 2012.
    [doi:10.1007/978-3-642-31612-8_28] Preliminary version: [pdf] [abstract/bibtex]

  43. Weak Models of Distributed Computing, with Connections to Modal Logic.
    Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, and Jonni Virtema.
    In Darek Kowalski and Alessandro Panconesi, editors, Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2012), pages 185-194. ACM Press, 2012.
    [doi:10.1145/2332432.2332466] Preliminary version: [pdf] [abstract/bibtex] Preliminary extended version: [arXiv:cs.DC/1205.2051]

  44. On the Relative Efficiency of DPLL and OBDDs with Axiom and Join.
    Matti Järvisalo.
    In Jimmy Lee, editor, Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP 2011), volume 6876 of Lecture Notes in Computer Science, pages 429-437. Springer, 2011.
    [doi:10.1007/978-3-642-23786-7_33] Preliminary version: [pdf] [abstract/bibtex]

  45. Depth-Driven Circuit-Level Stochastic Local Search for SAT.
    Anton Belov, Matti Järvisalo, and Zbigniew Stachniak.
    In Toby Walsh, editor, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pages 504-509. AAAI Press, 2011.
    [Publisher's copy] Preliminary version: [pdf] [abstract/bibtex]

  46. Efficient CNF Simplification based on Binary Implication Graphs.
    Marijn Heule, Matti Järvisalo, and Armin Biere.
    In Karem Sakallah and Laurent Simon, editors, Proceedings of the 14th International Conference on Theory and Applications of Satisfiability Testing (SAT 2011), volume 6695 of Lecture Notes in Computer Science, pages 201-215. Springer, 2011.
    [doi:10.1007/978-3-642-21581-0_17] Preliminary version: [pdf] [abstract/bibtex]

  47. Itemset Mining as a Challenge Application for Answer Set Enumeration.
    Matti Järvisalo.
    In James Delgrande and Wolfgang Faber, editors, Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2011), volume 6645 of Lecture Notes in Computer Science, pages 304-310. Springer, 2011.
    [doi:10.1007/978-3-642-20895-9_35] Preliminary version: [pdf] [abstract/bibtex]

  48. Clause Elimination Procedures for CNF Formulas.
    Marijn Heule, Matti Järvisalo, and Armin Biere.
    In Christian Fermüller and Andrei Voronkov, editors, Proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-17), volume 6397 of Lecture Notes in Computer Science (LNCS/ARCoSS), pages 357-371. Springer, 2010.
    [doi:10.1007/978-3-642-16242-8_26] Preliminary version: [pdf] [abstract/bibtex]

  49. Reconstructing Solutions after Blocked Clause Elimination.
    Matti Järvisalo and Armin Biere.
    In Ofer Strichman and Stefan Szeider, editors, Proceedings of the 13th International Conference on Theory and Applications of Satisfiability Testing (SAT 2010), volume 6175 of Lecture Notes in Computer Science (LNCS), pages 340-345. Springer, 2010.
    [doi:10.1007/978-3-642-14186-7_30] Preliminary version: [pdf] [abstract/bibtex]

  50. Blocked Clause Elimination.
    Matti Järvisalo, Armin Biere, and Marijn Heule.
    In Javier Esparza and Rupak Majumdar, editors, Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2010), volume 6015 of Lecture Notes in Computer Science (LNCS), pages 129-144. Springer, 2010.
    [doi:10.1007/978-3-642-12002-2_10] Preliminary version: [pdf] [abstract/bibtex]

  51. Max-ASP: Maximum Satisfiability of Answer Set Programs.
    Emilia Oikarinen and Matti Järvisalo.
    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 (LNCS/LNAI), pages 236-249. Springer, 2009.
    [doi:10.1007/978-3-642-04238-6_21] [pdf] [abstract/bibtex]

  52. A Module-Based Framework for Multi-Language Constraint Modeling.
    Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä.
    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 (LNCS/LNAI), pages 155-168. Springer, 2009.
    [doi:10.1007/978-3-642-04238-6_15] [pdf] [abstract/bibtex]

  53. Justification-Based Local Search with Adaptive Noise Strategies.
    Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä.
    In Iliano Cervesato, Helmut Veith, and Andrei Voronkov, editors, Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2008), volume 5330 of Lecture Notes in Computer Science, pages 31-46. Springer, 2008.
    [doi:10.1007/978-3-540-89439-1_3] [pdf] [abstract/bibtex]

  54. Justification-Based Non-Clausal Local Search for SAT.
    Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä.
    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.
    [doi:10.3233/978-1-58603-891-5-535] [pdf] [abstract/bibtex]

  55. On the Power of Top-Down Branching Heuristics.
    Matti Järvisalo and Tommi Junttila.
    In Dieter Fox and Carla P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pages 304-309. AAAI Press, 2008.
    [Publisher's copy] [pdf] [abstract/bibtex]

  56. Limitations of Restricted Branching in Clause Learning.
    Matti Järvisalo and Tommi Junttila.
    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 (LNCS), pages 348-363. Springer, 2007.
    [Runner-up for the CP'07 Best Paper Award]
    [doi:10.1007/978-3-540-74970-7_26] [pdf] [abstract/bibtex]

  57. Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs.
    Matti Järvisalo and Emilia Oikarinen.
    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 (LNCS), pages 134-148. Springer 2007.
    [ICLP'07 Best Student Paper Award]
    [doi:10.1007/978-3-540-74610-2_10] [pdf] [bibtex]

  58. Further Investigations into Regular XORSAT.
    Matti Järvisalo.
    In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), pages 1873-1874. AAAI Press, 2006.
    [Publisher's copy] [pdf] [bibtex]

  59. Opinions, Hopes, and Expectations of CS&E Students, A Case Study in Academic Skills and Hidden Curriculum.
    Matti Järvisalo.
    In Tapio Salakoski, Tomi Mäntylä, and Mikko Laakso, editors, Koli Calling 2005 - Proceedings of the Fifth Koli Calling Conference on Computer Science Education, volume 41 of TUCS General Publications. Turku Centre for Computer Science, 2006. ISBN 951-29-3006-4.
    [abstract/bibtex]

  60. Teaching Smullyan's Analytic Tableaux in a Scalable Learning Environment.
    Tomi Janhunen, Toni Jussila, Matti Järvisalo, and Emilia Oikarinen.
    In Ari Korhonen and Lauri Malmi, editors, Kolin Kolistelut - Koli Calling 2004, 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.
    [abstract/bibtex]

  61. Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits.
    Matti Järvisalo, Tommi A. Junttila, and Ilkka Niemelä.
    In Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2004), pages 129-136, 2004.
    Journal version: [Springerlink] Preliminary full version: [pdf] [abstract/bibtex]

In Peer-Reviewed International Workshops

  1. Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability.
    Jeremias Berg, Matti Järvisalo, and Brandon Malone.
    In 21st RCRA International Workshop on Experimental Evaluation of Algorithms for solving problems with combinatorial explosion (RCRA 2014), 2014.
    [See the AISTATS'14 version.]

  2. Optimal Neighborhood Preserving Visualization by Maximum Satisfiability.
    Kerstin Bunte, Matti Järvisalo, Jeremias Berg, Petri Myllymäki, Jaakko Peltonen, and Samuel Kaski.
    In 4th International Workshop on Logic and Search (LaSh 2014), 2014.
    [See the AAAI'14 version.]

  3. Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure.
    Antti Hyttinen, Patrik Hoyer, Frederick Eberhardt, and Matti Järvisalo.
    In UAI 2013 Approaches to Causal Structure Learning Workshop, 2013.
    [See the UAI'13 version.]

  4. CEGARTIX: A SAT-Based Argumentation System.
    Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
    In 3rd Workshop on Pragmatics of SAT (PoS 2012), 2012.
    [See the AIJ'14 article.]

  5. Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability.
    Anton Belov and Matti Järvisalo.
    In Laurent Michel and Steve Prestwich, editors, Proceedings of the 8th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2011), pages 3-17, 2011.
    Local copy: [pdf] [abstract/bibtex]

  6. A Module-Based Framework for Multi-Language Constraint Modeling.
    Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, and Ilkka Niemelä.
    In 2nd Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2009), 2009.
    [See the LPNMR'09 version.]

  7. Justification-Based Local Search with Adaptive Noise Strategies.
    Matti Järvisalo, Tommi Junttila, and Ilkka Niemelä.
    In Proceedings of the 2nd International Workshop on Logic and Search: Computation of structures from declarative descriptions (LaSh 2008), pages 111-125. KU Leuven, 2008.
    [See the LPAR'08 version] [abstract/bibtex]

  8. Restricted Branching in Clause Learning DPLL.
    Matti Järvisalo.
    In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Programme, 2007.
    [See the CP'07 and Constraints (2009) versions.]

  9. The Effect of Structural Branching on the Efficiency of Clause Learning SAT Solving.
    Matti Järvisalo.
    In 14th RCRA Workshop: Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007.
    [pdf] [abstract/bibtex]
    [See the J.ARGOL version.]

  10. A Compact Reformulation of Propositional Satisfiability as Binary Constraint Satisfaction.
    Matti Järvisalo and Ilkka Niemelä.
    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 (ModRef 2004), pages 111-124, 2004.
    [pdf] [abstract/bibtex]

Edited Volumes

  1. Proceedings of SAT Competition 2016: Solver and Benchmark Descriptions.
    Tomáš Balyo, Marijn J.H. Heule, and Matti Järvisalo (editors).
    Volume B-2016-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2016.
    ISBN 978-951-51-2345-9.
    [handle:10138/164630] [bibtex]

  2. Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions.
    Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo (editors),
    volume B-2014-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2014.
    ISBN 978-951-51-0043-6.
    [handle:10138/135571] [bibtex]

  3. Theory and Applications of Satisfiability Testing - SAT 2013.
    Matti Järvisalo and Allen Van Gelder (editors).
    volume 7962 of Lecture Notes in Computer Science, Springer 2013.
    ISBN 978-3-642-39070-8.
    [Book at Springer.com]

  4. Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions.
    Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo (editors),
    volume B-2013-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2013.
    ISBN 978-952-10-8991-6.
    [handle:10138/40026] [bibtex]

  5. Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions.
    Adrian Balint, Anton Belov, Daniel Diepold, Simon Gerber, Matti Järvisalo, and Carsten Sinz (editors),
    volume B-2012-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2012.
    ISBN 978-952-10-8106-4.
    [handle:10138/34218] [bibtex]

Theses

  1. Structure-Based Satisfiability Checking: Analyzing and Harnessing the Potential
    Matti Järvisalo.
    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) / 978-951-22-9642-2 (online).
    [abstract/bibtex] [Online version]

  2. Impact of Restricted Branching on Clause Learning SAT Solving.
    Matti Järvisalo.
    Licentiate's thesis.
    Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, 2007.
    [bibtex]

  3. Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability Checking.
    Matti Järvisalo.
    Master's thesis.
    Helsinki University of Technology, Department of Computer Science and Engineering, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004.
    [abstract/bibtex]

Other Scientific Publications

  1. SAT Competition 2016: Recent Developments.
    Tomas Balyo, Marijn J.H. Heule, and Matti Järvisalo.
    In Satinder P. Singh and Shaul Markovitch, editors, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pages 5061-5063. AAAI Press, 2017.
    [AAAI-17 What's Hot Track Invited Talk companion paper]
    [Publisher's version] [pdf] [abstract/bibtex]

  2. Boolean Satisfiability and Beyond: Algorithms, Analysis, and AI Applications.
    Matti Järvisalo.
    In Subbarao Kambhampati, editor, Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pages 4066-4069. AAAI Press, 2016.
    [IJCAI-16 Early Career Spotlight Talk companion paper]
    [Publisher's version] [pdf] [abstract/bibtex]

  3. SAT-Based Approaches to Reasoning about Argumentation Frameworks.
    Matti Järvisalo.
    In Sarah Alice Gaggl, Juan Carlos Nieves, and Hannes Strass, editors, Proceedings of the First International Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (Arg-LPNMR 2016), pages 1-2, 2016.
    [ArgLPNMR 2016 invited talk companion paper]
    [pdf] [abstract/bibtex]

  4. CEGARTIX v0.4: A SAT-Based Counter-Example Guided Argumentation Reasoning Tool.
    Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
    In Matthias Thimm and Serena Villata, editors, System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15), pages 12--14, 2015.
    [pdf]

  5. Generating the Uniform Random Benchmarks.
    Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo.
    In Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions, volume B-2014-2 of Department of Computer Science Series of Publications B, page 80. University of Helsinki, 2014.
    [handle:10138/135571]

  6. The Application and the Hard Combinatorial Benchmarks in SAT Competition 2014.
    Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo.
    In Proceedings of SAT Competition 2014: Solver and Benchmark Descriptions, volume B-2014-2 of Department of Computer Science Series of Publications B, pages 81-82. University of Helsinki, 2014.
    [handle:10138/135571]

  7. Equivalence Checking of HWMCC 2012 Circuits.
    Armin Biere, Marijn J.H. Heule, Matti Järvisalo, and Norbert Manthey.
    In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, volume B-2013-1 of Department of Computer Science Series of Publications B, page 104. University of Helsinki, 2013.
    [handle:10138/40026]

  8. Generating the Uniform Random Benchmarks for SAT Competition 2013.
    Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo.
    In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, volume B-2013-1 of Department of Computer Science Series of Publications B, pages 97-98. University of Helsinki, 2013.
    [handle:10138/40026]

  9. The Application and the Hard Combinatorial Benchmarks in SAT Competition 2013.
    Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo.
    In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, volume B-2013-1 of Department of Computer Science Series of Publications B, pages 99-101. University of Helsinki, 2013.
    [handle:10138/40026]

  10. Finding Circuits for Ensemble Computation via Boolean Satisfiability.
    Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen.
    In Proceedings of SAT Challenge 2012, volume B-2012-2 of Department of Computer Science Series of Publications B, pages 79-81. University of Helsinki, 2012.
    [handle:10138/34218]

  11. Application and Hard Combinatorial Benchmarks in SAT Challenge 2012.
    Adrian Balint, Anton Belov, Matti Järvisalo, and Carsten Sinz.
    In Proceedings of SAT Challenge 2012, volume B-2012-2 of Department of Computer Science Series of Publications B, pages 69-71. University of Helsinki, 2012.
    [handle:10138/34218]

  12. SAT Challenge 2012 Random SAT Track: Description of Benchmark Generation.
    Adrian Balint, Anton Belov, Matti Järvisalo, and Carsten Sinz.
    In Proceedings of SAT Challenge 2012, volume B-2012-2 of Department of Computer Science Series of Publications B, pages 72-73. University of Helsinki, 2012.
    [handle:10138/34218]

  13. Rules of the 2011 SAT Competition.
    Matti Järvisalo, Daniel Le Berre, and Olivier Roussel.
    [pdf]

  14. Blocked Clause Elimination and its Extentions.
    Marijn J.H. Heule, Matti Järvisalo, and Armin Biere.
    Extended abstract presented at Guangzhou Symposium on Satisfiability In Logic-Based Modeling, 2010.
    [pdf]

  15. Depth-Based Local Search Heuristics for Boolean Circuit Satisfiability.
    Anton Belov and Matti Järvisalo.
    HIIT Technical Reports 2010-2, Helsinki Institute for Information Technology HIIT, Helsinki, Finland, 2010. ISBN 978-952-60-3415-7.
    [pdf] [abstract/bibtex]

  16. Impact of Restricted Branching on Clause Learning SAT Solving.
    Matti Järvisalo.
    Research Report A107, Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2007. ISBN 978-951-22-8907-3.
    [pdf] [abstract/bibtex]

  17. Equivalence Checking Hardware Multiplier Designs.
    Matti Järvisalo.
    SAT Competition 2007 benchmark description.
    Benchmarks available here.
    [pdf] [bibtex]

  18. Industrial-Strength SAT Solving and Restricted Branching.
    Matti Järvisalo.
    In Veli Mäkinen, Greger Lindén, and Hannu Toivonen, editors, Summer School on Algorithmic Data Analysis (SADA 2007) and Annual Hecse Poster Session. Poster Abstracts, Series of Publications B, Report B-2007-4, page 39. Helsinki University Printing House, 2007. [bibtex]

  19. SAT Benchmarks based on 3-Regular Graphs.
    Harri Haanpää, Matti Järvisalo, Petteri Kaski, and Ilkka Niemelä.
    May 2005. SAT Competition 2005 benchmark description. Benchmark set available here and SAT Competition 2005 results through this link.
    [pdf] [Please cite our J.SAT 2006 article instead of this description!]

  20. Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa.
    Matti Järvisalo.
    Tietojenkäsittelytiede 22:47-63, 2004. In Finnish.
    [pdf] [abstract/bibtex]

  21. Proof Complexity of Cut-Based Tableaux for Boolean Circuit Satisfiability Checking.
    Matti Järvisalo.
    Research Report A90, Helsinki University of Technology, Laboratory for Theoretical Computer Science, Espoo, Finland, 2004. ISBN 951-22-7020-X.
    [pdf] [abstract/bibtex]

  22. Todistuskompleksisuudesta Boolen piirien toteutuvuustarkastuksessa.
    Matti Järvisalo.
    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.
    [pdf] [bibtex]

  23. Altistuminen ilman epäpuhtauksille - mallinnustyökalun kehittäminen.
    Hannu Koskela, Raimo Niemelä, Matti Järvisalo, and Petri Kauhaniemi.
    In Valtteri Hongisto and Riikka Helenius, editors, Työhygienian päivät 2001, volume 16 of Report Series of Turku Regional Institute for Occupational Health, pages 105-112, 2001. In Finnish.