Publications by Matti Järvisalo

[2024-] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [2001]

This list is also available sorted by type.

2024-

Learning MDL Logic Programs from Noisy Data
Céline Hocquette, Andreas Niskanen, Matti Järvisalo, and Andrew Cropper.
In ???, editors, Proceedings of the 38th Annual AAAI Conference on Artificial Intelligence (AAAI 2024), pages ????-????. AAAI Press, 2024.
[Publisher's version] [pdf] [abstract/bibtex]
Core Boosting in SAT-Based Multi-Objective Optimization
Christoph Jabs, Jeremias Berg, and Matti Järvisalo.
In ???, editors, Proceedings of the 21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2024), volume ????? of Lecture Notes in Computer Science (LNCS), pages ???-???. Springer, 2024.
[doi:???] [pdf] [abstract/bibtex]

2023

Unifying Core-Guided and Implicit Hitting Set based Optimization.
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo.
In Proceedings of the 32nd International Joint Conference on Artificial Intelligence (IJCAI 2023), pages 1935-1943. IJCAI.org, 2023.
[doi:10.24963/ijcai.2023/215] [pdf] [abstract/bibtex]
SAT-based Judgment Aggregation.
Ari Conati, Andreas Niskanen, and Matti Järvisalo.
In Noa Agmon, Bo An, Alessandro Ricci, and William Yeoh, editor, Proceedings of the 22nd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2023), pages 1412-1420. IFAAMAS, 2023.
[doi:10.5555/3545946.3598792] [pdf] [abstract/bibtex]
Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization.
Christoph Jabs, Jeremias Berg, Hannes Ihalainen, and Matti Järvisalo.
In Roland H. C. Yap, editor, Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming (CP 2023), volume 280 of Leibniz International Proceedings in Informatics, pages 18:1-18:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
[doi:10.4230/LIPIcs.CP.2023.18] [pdf] [abstract/bibtex]
Oracle-Based Local Search for Pseudo-Boolean Optimization.
Markus Iser, Jeremias Berg, and Matti Järvisalo.
In Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, and Roxana Radulescu, editors, Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023), volume 372 of Frontiers in Artificial Intelligence and Applications, pages 1124-1131. IOS Press, 2023.
[doi:10.3233/FAIA230387] [pdf] [abstract/bibtex]
MaxSAT-Based Inconsistency Measurement.
Andreas Niskanen, Isabelle Kuhlmann, Matthias Thimm, and Matti Järvisalo.
In Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, and Roxana Radulescu, editors, Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023), volume 372 of Frontiers in Artificial Intelligence and Applications, pages 1779-1786. IOS Press, 2023.
[doi:10.3233/FAIA230464] [pdf] [abstract/bibtex]
Argumentative Reasoning in ASPIC+ under Incomplete Information.
Daphne Odekerken, Tuomo Lehtonen, AnneMarie Borg, Johannes P. Wallner, and Matti Järvisalo.
In Pierre Marquis, Tran Cao Son, and Gabriele Kern-Isberner, editors, Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023), pages 531-541. IJCAI.org, 2023.
[doi:10.24963/kr.2023/52] [pdf] [abstract/bibtex]
Computing MUS-Based Inconsistency Measures.
Isabelle Kuhlmann, Andreas Niskanen, and Matti Järvisalo.
In Magdalena Ortiz, Maria Vanina Martinez, and Sarah Gaggl, editors, Proceedings of the 18th European Conference on Logics in Artificial Intelligence (JELIA 2023), volume 14281 of Lecture Notes in Computer Science (LNCS/LNAI), pages 745-755. Springer, 2023.
[doi:10.1007/978-3-031-43619-2_50] [pdf] [abstract/bibtex]
Design of ICCMA 2023, 5th International Competition on Computational Models of Argumentation: A Preliminary Report
Matti Järvisalo, Tuomo Lehtonen, and Andreas Niskanen.
In Oana Cocarascu, Sylvie Doutre, Jean-Guy Mailly, and Antonio Rago (editors), Proceedings of the 1st International Workshop on Argumentation and Applications, (Arg&App 2023), volume 3472 of CEUR Workshop Proceedings, pages 4-10. CEUR-WS.org, 2023.
[doi:???] [pdf] [abstract/bibtex]
Proceedings of SAT Competition 2023: Solver, Benchmark and Proof Checker Descriptions
Tomas Balyo, Marijn J.H. Heule, Markus Iser, Matti Järvisalo, and Martin Suda (editors).
Volume B-2023-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2023.
[handle:10138/563824] [bibtex]
MaxSAT Evaluation 2023: Solver and Benchmark Descriptions.
Jeremias Berg, Matti Järvisalo, Ruben Martins, and Andreas Niskanen (editors).
Volume B-2023-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2023.
[handle:10138/564026] [bibtex]

2022

Incremental Maximum Satisfiability.
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo.
In Kuldeep S. Meel and Ofer Strichman, editor, Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), volume 236 of Leibniz International Proceedings in Informatics, pages 14:1-14:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[doi:10.4230/LIPIcs.SAT.2022.14] [pdf] [abstract/bibtex]
MaxSAT-Based Bi-Objective Boolean Optimization.
Christoph Jabs, Jeremias Berg, Andreas Niskanen, and Matti Järvisalo.
In Kuldeep S. Meel and Ofer Strichman, editor, Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), volume 236 of Leibniz International Proceedings in Informatics, pages 12:1-12:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[doi:10.4230/LIPIcs.SAT.2022.12] [pdf] [abstract/bibtex]
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization.
Pavel Smirnov, Jeremias Berg, and Matti Järvisalo.
In Kuldeep S. Meel and Ofer Strichman, editor, Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), volume 236 of Leibniz International Proceedings in Informatics, pages 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022.
[doi:10.4230/LIPIcs.SAT.2022.13] [pdf] [abstract/bibtex]
Clause Redundancy and Preprocessing in Maximum Satisfiability.
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo.
In Jasmin Blanchette, Laura Kovacs, and Dirk Pattinson, editors, Proceedings of the 11th International Joint Conference on Automated Reasoning (IJCAR 2022), volume 13385 of Lecture Notes in Computer Science (LNCS/LNAI), pages 75-94. Springer, 2022.
[doi:10.1007/978-3-031-10769-6_6] [pdf] [abstract/bibtex]
Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
In Gabriele Kern-Isberner, Gerhard Lakemeyer, and Thomas Meyer, editors, Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning (KR 2022), pages 215-225. IJCAI.org, 2022.
[Publisher's version] [pdf] [abstract/bibtex]
Computing Smallest MUSes of Quantified Boolean Formulas.
Andreas Niskanen, Jere Mustonen, Jeremias Berg, and Matti Järvisalo.
In Georg Gottlob, Daniela Inclezan and Marco Maratea, editors, Proceedings of the 16th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, pages 301-314. Springer, 2022.
[doi:10.1007/978-3-031-15707-3_23] Preliminary version: [pdf] [abstract/bibtex]
Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
In Francesca Toni, Sylwia Polberg, Richard Booth, Martin Caminada, and Hiroyuki Kido, editors, Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), volume 353 of Frontiers in Artificial Intelligence and Applications, pages 236-247. IOS Press, 2022.
[doi:10.3233/FAIA220156] [pdf] [abstract/bibtex]
Proceedings of SAT Competition 2022: Solver and Benchmark Descriptions.
Tomas Balyo, Marijn J.H. Heule, Markus Iser, Matti Järvisalo, and Martin Suda (editors).
Volume B-2022-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2022.
[handle:10138/347211] [bibtex]
MaxSAT Evaluation 2022: Solver and Benchmark Descriptions.
Fahiem Bacchus, Jeremias Berg, Matti Järvisalo, Ruben Martins, and Andreas Niskanen (editors).
Volume B-2022-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2022.
[handle:10138/347396] [bibtex]

2021

Maximum Satisfiability.
Fahiem Bacchus, Matti Järvisalo, and Ruben Martins.
In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (editors), chapter 24 of Handbook of Satisfiability, 2nd edition, volume 336 of of Frontiers in Artificial Intelligence and Applications, pages 929-991. IOS Press, 2021.
[doi:10.3233/FAIA201008] [author version] [abstract/bibtex]
Preprocessing in SAT Solving.
Armin Biere, Matti Järvisalo, and Benjamin Kiesl.
In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (editors), chapter 9 of Handbook of Satisfiability, 2nd edition, volume 336 of of Frontiers in Artificial Intelligence and Applications, pages 391-435. IOS Press, 2021.
[doi:10.3233/FAIA200992] [author version] [abstract/bibtex]
Acceptance in Incomplete Argumentation Frameworks.
Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, and Jörg Rothe.
Artificial Intelligence 295:103470, 2021.
[doi:10.1016/j.artint.2021.103470] [pdf] [abstract/bibtex]
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
Journal of Artificial Intelligence Research 71:265-318, 2021.
[doi:10.1613/jair.1.12479] [pdf] [abstract/bibtex]
SAT Competition 2020.
Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda.
Artificial Intelligence 301:103572, 2021.
[doi:10.1016/j.artint.2021.103572] [pdf] [abstract/bibtex]
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
Theory and Practice of Logic Programming 21(6):717-734, 2021.
[doi:10.1017/S1471068421000296] [pdf (@arXiv)] [abstract/bibtex]
Maximal Ancestral Graph Structure Learning via Exact Search. Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
In Cassio P. de Campos, Marloes H. Maathuis, and Erik Quaeghebeur, editors, Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021), volume 161 of Proceedings of Machine Learning Research, pages 1237-1247. PMLR, 2021.
[pdf] [abstract/bibtex]
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters.
Tuukka Korhonen and Matti Järvisalo.
In Laurent D. Michel, editor, Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics, pages 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[doi:10.4230/LIPIcs.CP.2021.8] [pdf] [abstract/bibtex]
Pseudo-Boolean Optimization by Implicit Hitting Sets.
Pavel Smirnov, Jeremias Berg, and Matti Järvisalo.
In Laurent D. Michel, editor, Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics, pages 51:1-51:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[doi:10.4230/LIPIcs.CP.2021.51] [pdf] [abstract/bibtex]
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT under Changing Weights.
Andreas Niskanen, Jeremias Berg, and Matti Järvisalo.
In Laurent D. Michel, editor, Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics, pages 44:1-44:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[doi:10.4230/LIPIcs.CP.2021.44] [pdf] [abstract/bibtex]
Refined Core Relaxation for Core-Guided MaxSAT Solving.
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo.
In Laurent D. Michel, editor, Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming (CP 2021), volume 210 of Leibniz International Proceedings in Informatics, pages 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[doi:10.4230/LIPIcs.CP.2021.28] [pdf] [abstract/bibtex]
Proceedings of SAT Competition 2021: Solver and Benchmark Descriptions.
Tomas Balyo, Nils Froleyks, Marijn J.H. Heule, Markus Iser, Matti Järvisalo, and Martin Suda (editors).
Volume B-2021-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2021.
[handle:10138/333647] [bibtex]
MaxSAT Evaluation 2021: Solver and Benchmark Descriptions.
Fahiem Bacchus, Jeremias Berg, Matti Järvisalo, and Ruben Martins (editors).
Volume B-2021-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2021.
[handle:10138/333649] [bibtex]

2020

Discovering Causal Graphs with Cycles and Latent Confounders: An Exact Branch-and-Bound Approach.
Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
International Journal of Approximate Reasoning 117:29-49, 2020.
[doi:10.1016/j.ijar.2019.10.009] [pdf] [abstract/bibtex]
Controllability of Control Argumentation Frameworks.
Andreas Niskanen, Daniel Neugebauer, and Matti Järvisalo
In Christian Bessiere, editor, Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI 2020), pages 1855-1861. ijcai.org, 2020.
[pdf] [abstract/bibtex]
Finding Most Compatible Phylogenetic Trees over Multi-State Characters.
Tuukka Korhonen and Matti Järvisalo.
In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pages 1544-1551. AAAI Press, 2020.
[pdf] [abstract/bibtex]
Deciding Acceptance in Incomplete Argumentation Frameworks.
Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, and Jörg Rothe
In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pages 2942-2949. AAAI Press, 2020.
[pdf] [abstract/bibtex]
Preprocessing in Incomplete MaxSAT Solving.
Marcus Leivo, Jeremias Berg, and Matti Järvisalo.
In Giuseppe De Giacomo, Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro, Alberto Bugarin, and Jerome Lang, editors, Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, pages 347-354. IOS Press, 2020.
[doi:0.3233/FAIA200112] [pdf] [abstract/bibtex]
Learning Chordal Markov Networks via Stochastic Local Search.
Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
In Giuseppe De Giacomo, Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro, Alberto Bugarin, and Jerome Lang, editors, Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, pages 2632-2639. IOS Press, 2020.
[doi:10.3233/FAIA200400] [pdf] [abstract/bibtex]
Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach.
Andreas Niskanen and Matti Järvisalo.
In Giuseppe De Giacomo, Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro, Alberto Bugarin, and Jerome Lang, editors, Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, pages 849-856. IOS Press, 2020.
[doi:10.3233/FAIA200175] [pdf] [abstract/bibtex]
Strong Refinements for Hard Problems in Argumentation Dynamics.
Andreas Niskanen and Matti Järvisalo.
In Giuseppe De Giacomo, Alejandro Catala, Bistra Dilkina, Michela Milano, Senen Barro, Alberto Bugarin, and Jerome Lang, editors, Proceedings of the 24th European Conference on Artificial Intelligence (ECAI 2020), volume 325 of Frontiers in Artificial Intelligence and Applications, pages 841-848. IOS Press, 2020.
[doi:10.3233/FAIA200174] [pdf] [abstract/bibtex]
Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation.
Jarkko Savela, Emilia Oikarinen, and Matti Järvisalo.
In Elvira Albert and Laura Kovacs, editors, Proceedings of the 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-23), volume 73 of EPiC Series in Computing, pages 465-482. EasyChair, 2020.
[pdf] [abstract/bibtex]
An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
In Diego Calvanese, Esra Erdem, and Michael Thielscher, editors, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pages 636-646. IJCAI.org, 2020.
[pdf] [abstract/bibtex]
Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation.
Andreas Niskanen and Matti Järvisalo.
In Diego Calvanese, Esra Erdem, and Michael Thielscher, editors, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pages 667-671. AAAI Press, 2020.
[pdf] [abstract/bibtex]
μ-toksia: An Efficient Abstract Argumentation Reasoner.
Andreas Niskanen and Matti Järvisalo.
In Diego Calvanese, Esra Erdem, and Michael Thielscher, editors, Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pages 800-804. AAAI Press, 2020.
[pdf] [abstract/bibtex]
Learning Optimal Cyclic Causal Graphs from Interventional Data.
Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
In Manfred Jaeger and Thomas Dyhre Nielsen, editors, Proceedings of the 10th International Conference on Probabilistic Graphical Models (PGM 2020), volume 138 of Proceedings of Machine Learning Research, pages 365-376. JMLR, 2020.
[pdf] [abstract/bibtex]
Proceedings of SAT Competition 2020: Solver and Benchmark Descriptions.
Tomas Balyo, Nils Froleyks, Marijn J.H. Heule, Markus Iser, Matti Järvisalo, and Martin Suda (editors).
Volume B-2020-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2020.
[handle:10138/318450] [bibtex]
MaxSAT Evaluation 2020: Solver and Benchmark Descriptions.
Fahiem Bacchus, Jeremias Berg, Matti Järvisalo, and Ruben Martins (editors).
Volume B-2020-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2020.
[handle:10138/318451] [bibtex]

2019

Synthesizing Argumentation Frameworks from Examples.
Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
Journal of Artificial Intelligence Research 66:503-554, 2019.
[doi:10.1613/jair.1.11758] [pdf] [abstract/bibtex]
MaxSAT Evaluation 2018: New Developments and Detailed Results.
Fahiem Bacchus, Matti Järvisalo, and Ruben Martins.
Journal on Satisfiability, Boolean Modeling and Computation 11(1):99-131, 2019.
[doi:10.3233/SAT190119] [pdf] [abstract/bibtex]
SAT Competition 2018.
Marijn J. H. Heule, Matti Järvisalo, and Martin Suda.
Journal on Satisfiability, Boolean Modeling and Computation 11(1):133-154, 2019.
[doi:10.3233/SAT190120] [pdf] [abstract/bibtex]
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm.
Tuukka Korhonen, Jeremias Berg, and Matti Järvisalo.
ACM Journal of Experimental Algorithmics 24(1):1.9, 2019.
[doi:10.1145/3301297] [pdf] [abstract/bibtex]
Towards Transformational Creation of Novel Songs.
Jukka M. Toivanen, Matti Järvisalo, Olli Alm, Dan Ventura, Martti Vainio, and Hannu Toivonen.
Connection Science 31(1):4-32, 2019.
[doi:10.1080/09540091.2018.1443320] [abstract/bibtex]
Enumerating Potential Maximal Cliques via SAT and ASP.
Tuukka Korhonen, Jeremias Berg, and Matti Järvisalo.
In Sarit Kraus, editor, Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pages 1116-1122. AAAI Press, 2019.
[pdf] [abstract/bibtex]
Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings.
Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
In Proceedings of the 33rd AAAI Conference on Artificial Intelligence (AAAI 2019), pages 2938-2945. AAAI Press, 2019.
[pdf] [abstract/bibtex]
Centrality Heuristics for Exact Model Counting.
Bernhard Bliem and Matti Järvisalo.
In Proceedings of the IEEE 31st International Conference on Tools with Artificial Intelligence (ICTAI 2019), pages 59-63. IEEE Computer Society, 2019.
[doi:10.1109/ICTAI.2019.00017] [pdf] [abstract/bibtex]
Unifying Reasoning and Core-Guided Search for Maximum Satisfiability.
Jeremias Berg and Matti Järvisalo.
In Francesco Calimeri, Nicola Leone, and Marco Manna, editors, Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA 2019), volume 11468 of Lecture Notes in Computer Science, pages 287-303. Springer, 2019.
[doi:10.1007/978-3-030-19570-0_19] [pdf] [abstract/bibtex]
Preprocessing Argumentation Frameworks via Replacement Patterns.
Wolfgang Dvořák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen and Stefan Woltran.
In Francesco Calimeri, Nicola Leone, and Marco Manna, editors, Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA 2019), volume 11468 of Lecture Notes in Computer Science, pages 116-132. Springer, 2019.
[doi:10.1007/978-3-030-19570-0_8] [pdf] [abstract/bibtex]
Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018.
Daniel Le Berre and Matti Järvisalo (editors).
EPiC Series in Computing 59, EasyChair 2019.
[Online version]
Proceedings of SAT Race 2019: Solver and Benchmark Descriptions.
Marijn J.H. Heule, Matti Järvisalo, and Martin Suda (editors).
Volume B-2019-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2019.
[handle:10138/306988] [bibtex]
MaxSAT Evaluation 2019: Solver and Benchmark Descriptions.
Fahiem Bacchus, Matti Järvisalo, and Ruben Martins (editors).
Volume B-2019-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2019.
[handle:10138/306989] [bibtex]

2018

Cautious Reasoning in ASP via Minimal Models and Unsatisfiable Cores.
Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, and Alessandro Previti.
Theory and Practice of Logic Programming 18(3-4):319-336, 2018.
[doi:10.1017/S1471068418000145] [pdf] [abstract/bibtex]
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 107(1):247-283, 2018.
[doi:10.1007/s10994-017-5680-2] [pdf] [abstract/bibtex]
Reduced Cost Fixing for Maximum Satisfiability.
Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko.
In Jerome Lang, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), pages 5209-5213. IJCAI, 2018.
[IJCAI 2018 Best Sister Conference Paper Track]
[doi:10.24963/ijcai.2018/723] [pdf] [abstract/bibtex]
Premise Set Caching for Enumerating Minimal Correction Subsets.
Alessandro Previti, Carlos Mencia, Matti Järvisalo, and Joao Marques-Silva.
In Sheila A. McIlraith and Kilian Q. Weinberger, editors, Proceedings of the 32nd AAAI Conference on Artificial Intelligence (AAAI 2018). AAAI Press, 2018.
[pdf] [abstract/bibtex]
A Hybrid Approach to Optimization in Answer Set Programming.
Paul Saikko, Carmine Dodaro, Mario Alviano, and Matti Järvisalo.
In Michael Thielscher, Francesca Toni, and Frank Wolter, editors, Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), pages 32-41. AAAI Press, 2018.
[pdf] [abstract/bibtex]
Extension Enforcement under Grounded Semantics in Abstract Argumentation.
Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
In Michael Thielscher, Francesca Toni, and Frank Wolter, editors, Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), pages 178-183. AAAI Press, 2018.
[pdf] [abstract/bibtex]
Learning Optimal Causal Graphs with Exact Search.
Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
In Vaclav Kratochvil and Milan Studeny, editors, Proceedings of the 9th International Conference on Probabilistic Graphical Models (PGM 2018), volume 72 of Proceedings of Machine Learning Research, pages 344-355. JLMR.org, 2018.
[PGM 2018 Best Student Paper Award]
[pdf] [abstract/bibtex]
SAT-based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks.
Tuomo Lehtonen, Andreas Niskanen, and Matti Järvisalo.
In Sanjay Modgil, Katarzyna Budzynska, and John Lawrence, editors, Proceedings of the 7th International Conference on Computational Models of Argument (COMMA 2018), volume 305 of Frontiers in Artificial Intelligence and Applications, pages 193-204. IOS Press, 2018.
[doi:10.3233/978-1-61499-906-5-193] [pdf] [abstract/bibtex]
A Preference-Based Approach to Backbone Computation with Application to Argumentation.
Alessandro Previti and Matti Järvisalo.
In Hisham M. Haddad, Roger L. Wainwright, and Richard Chbeir, editors, Proceedings of the 33rd ACM/SIGAPP Symposium on Applied Computing (SAC 2018), pages 896-902. ACM, 2018.
[doi:10.1145/3167132.3167230] [pdf] [abstract/bibtex]
SAT for Argumentation.
Matti Järvisalo.
In Matthias Thimm, Federico Cerutti, and Mauro Vallati, editors, Proceedings of the 2nd International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018), volume 2171 of CEUR Workshop Proceedings, pages 1-3. CEUR-WS.org 2018.
[SAFA 2018 keynote talk extended abstract]
[pdf] [abstract/bibtex]
Proceedings of SAT Competition 2018: Solver and Benchmark Descriptions.
Marijn J.H. Heule, Matti Järvisalo, and Martin Suda (editors).
Volume B-2018-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2018.
[handle:10138/237063] [bibtex]
MaxSAT Evaluation 2018: Solver and Benchmark Descriptions.
Fahiem Bacchus, Matti Järvisalo, and Ruben Martins (editors).
Volume B-2018-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2018.
[handle:10138/237139] [bibtex]

2017

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 90:208-225, 2017.
[doi:10.1016/j.ijar.2017.07.009] [pdf] [abstract/bibtex]
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.
Johannes P. Wallner, Andreas Niskanen, and Matti Järvisalo.
Journal of Artificial Intelligence Research 60:1-40, 2017.
[doi:10.1613/jair.5415] [pdf] [abstract/bibtex]
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]
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]
Learning Chordal Markov Networks via Branch and Bound.
Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
In Isabelle Guyon, Ulrike von Luxburg, Samy Bengio, Hanna M. Wallach, Rob Fergus, S. V. N. Vishwanathan, and Roman Garnett, editors, Proceedings of the 30th Annual Conference on Neural Information Processing Systems (NIPS 2017), pages 1845-1855, 2017.
[pdf] [abstract/bibtex]
A Core-Guided Approach to Learning Optimal Causal Graphs.
Antti Hyttinen, Paul Saikko, and Matti Järvisalo.
In Carles Sierra, editor, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 645-651. IJCAI, 2017.
[doi:10.24963/ijcai.2017/90] [pdf] [abstract/bibtex]
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, editor, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 4990-4994. IJCAI, 2017.
[doi:10.24963/ijcai.2017/708] [pdf] [abstract/bibtex]
Weight-Aware Core Extraction in SAT-Based MaxSAT Solving.
Jeremias Berg and Matti Järvisalo.
In J. Christopher Beck, editor, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume 10416 of Lecture Notes in Computer Science, pages 652-670. Springer, 2017.
[doi:10.1007/978-3-319-66158-2_42] [pdf] [abstract/bibtex]
Reduced Cost Fixing in MaxSAT.
Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko.
In J. Christopher Beck, editor, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume 10416 of Lecture Notes in Computer Science, pages 641-651 Springer, 2017.
[CP 2017 Distinguished Paper Award]
[doi:10.1007/978-3-319-66158-2_41] [pdf] [abstract/bibtex]
Minimum-Width Confidence Bands via Constraint Optimization.
Jeremias Berg, Emilia Oikarinen, Matti Järvisalo, and Kai Puolamäki.
In J. Christopher Beck, editor, Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming (CP 2017), volume 10416 of Lecture Notes in Computer Science, pages 443-459. Springer, 2017.
[doi:10.1007/978-3-319-66158-2_29] [pdf] [abstract/bibtex]
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 184-194. Springer, 2017.
[doi:10.1007/978-3-319-66263-3_12] [pdf] [abstract/bibtex]
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 449-456. Springer, 2017.
[doi:10.1007/978-3-319-66263-3_28] [pdf] [abstract/bibtex]
On Computing Generalized Backbones.
Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, and Joao Marques-Silva.
In Proceedings of the IEEE 29th International Conference on Tools with Artificial Intelligence (ICTAI 2017), pages 1050-1056. IEEE Computer Society, 2017.
[doi:10.1109/ICTAI.2017.00161] [pdf] [abstract/bibtex]
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 of the 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]
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]
AS-ASL: Algorithm Selection with Auto-sklearn.
Brandon Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, and Petri Myllymäki.
In Marius Lindauer, Jan N. van Rijn, and Lars Kotthoff, editors, Open Algorithm Selection Challenge 2017, volume 79 of Proceedings of Machine Learning Research, pages 19-22. JMLR, 2017.
[Publisher's version] [pdf] [abstract/bibtex]
Proceedings of SAT Competition 2017: Solver and Benchmark Descriptions.
Tomáš Balyo, Marijn J.H. Heule, and Matti Järvisalo (editors).
Volume B-2017-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2017.
[handle:10138/224324] [bibtex]
MaxSAT Evaluation 2017: Solver and Benchmark Descriptions.
Carlos Ansotegui, Fahiem Bacchus, Matti Järvisalo, and Ruben Martins (editors).
Volume B-2017-2 of Department of Computer Science Series of Publications B, University of Helsinki, 2017.
[handle:10138/228949] [bibtex]

2016

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]
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]
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]
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]
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.
[ECAI 2016 Runner-up Best Student Paper Award]
[doi:10.3233/978-1-61499-672-9-551] [pdf] [abstract/bibtex]
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]
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]
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]
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]
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]
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'sversion] [pdf] [abstract/bibtex]
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]
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]
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]

2015

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.
[2019 IJCAI-JAIR Best Paper Prize]
[doi:10.1613/jair.4694] [pdf] [abstract/bibtex]
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]
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]
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]
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]
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]
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]
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]
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]
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]
Applications of MaxSAT in Data Analysis.
Jeremias Berg, Antti Hyttinen, and Matti Järvisalo.
In Proceedings of Proceedings of Pragmatics of SAT 2015/ Pragmatics of SAT 2018, volume 59 of Easychair Proceedings in Computing, pages 50-64. Easychair, 2019.
[pdf] [abstract/bibtex]
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]

2014

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]
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]
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]
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]
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]
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]
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]
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]
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]
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]

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]

2013

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]
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]
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]
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 7874 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]
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]
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]
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]
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]

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]

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]

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]

2012

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

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]

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]

SAT Challenge 2012 Random SAT Track: Description of Benchmark Generation.
Adrian Balint, Anton Belov, Matti Järvisalo, and Carsten Sinz.
Matti Järvisalo, and Carsten Sinz, editors, 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]

2011

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]
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]
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]
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]
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.

2010

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]
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]
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]
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]
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]
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]

2009

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]
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]
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.
[10.1007/978-3-642-04238-6_21] [pdf] [abstract/bibtex]
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]
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.

2008

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]
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]
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]
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]
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]
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]
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]

2007

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]
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]
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]
Restricted Branching in Clause Learning DPLL.
Matti Järvisalo.
In Brahim Hnich and Kostas Stergiou, editors, Proceedings of the CP 2007 Doctoral Programme, 2007.
[bibtex]
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]
Equivalence Checking Hardware Multiplier Designs.
Matti Järvisalo.
SAT Competition 2007 benchmark description.
Benchmarks available here.
[pdf] [bibtex]
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]
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]

2006

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]
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]
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]

2005

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]
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!]

2004

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] [abstract/bibtex]
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]
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]
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]
Lauselogiikan toteutuvuustarkastus: käytännönläheistä teoriaa.
Matti Järvisalo.
Tietojenkäsittelytiede 22:47-63, 2004. In Finnish.
[pdf] [abstract/bibtex]
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]
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]

2001

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.