Publications

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]

The Impact of Treewidth on Grounding and Solving of Answer Set Programs. Bernhard Bliem, Michael Morak, Marius Moldovan, and Stefan Woltran. Journal of Artificial Intelligence Research 67:35-80, 2020.
[doi:10.1613/jair.1.11515]

Controllability of Control Argumentation Frameworks. Andreas Niskanen, Daniel Neugebauer, and Matti Järvisalo. In Proceedings of the 29th International Joint Conference on Artificial Intelligence and the 17th Pacific Rim International Conference on Artificial Intelligence (IJCAI-PRICAI 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]

Abstract Cores in Implicit Hitting Set MaxSat Solving. Jeremias Berg, Fahiem Bacchus, and Alex Poole. In Luca Pulina and Martina Seidl, editors, Proceedings of the 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020), volume 12178 of Lecture Notes in Computer Science, pages 277-294. Springer, 2020. 
[SAT 2020 Best Paper Award]

Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. Jarkko Savela, Emilia Oikarinen, and Matti Järvisalo. In Elvira Albert and Laura Kovács, 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]

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, 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.
[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, 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.
[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, 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.
[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, 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.
[pdf] [abstract/bibtex]

Core-Guided and Core-Boosted Search for CP. Graeme Grange, Jeremias Berg, Emir Demirovic, and Peter Stuckey. In Emmanuel Hebrard and Nysret Musliu, editors, Proceedings of the 17th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2020), volume 12296 of Lecture Notes in Computer Science, pages 205-221. Springer, 2020. 

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. AAAI Press, 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.org, 2020.
[pdf] [abstract/bibtex]

Finding Optimal Triangulations Parameterized by Edge Clique Cover. Tuukka Korhonen. In Yixin Cao and Marcin Pilipczuk, editors, Proceeding of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), volume 180 of LIPIcs, pages 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. 
[link]

PACE Solver Description: SMS. Tuukka Korhonen. In Yixin Cao and Marcin Pilipczuk, editors, Proceeding of the 15th International Symposium on Parameterized and Exact Computation (IPEC 2020), volume 180 of LIPIcs, pages 30:1-30:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. 
[link]

Computational Approaches to Dynamics and Uncertainty in Abstract Argumentation. Andreas Niskanen. PhD thesis, University of Helsinki, 2020.
[http://urn.fi/URN:ISBN:978-951-51-6617-3]

Finding Optimal Tree Decompositions. Tuukka Korhonen. Master's thesis, University of Helsinki, 2020.
[http://urn.fi/URN:NBN:fi:hulib-202006173010]

Finding Periodic Apartments: A Computational Study of Hyperbolic Buildings. Jarkko Savela. Master's thesis, University of Helsinki, 2020.
[http://urn.fi/URN:NBN:fi:hulib-202008173796]

Preprocessing and Stochastic Local Search in Maximum Satisfiability. Marcus Leivo. Master's thesis, University of Helsinki, 2020.
[http://urn.fi/URN:NBN:fi:hulib-202008173800]

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]

Synthesizing Argumentation Frameworks from Examples. Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo. Journal of Artificial Intelligence Research 65:504-554, 2019.
[doi:10.1613/jair.1.11758] [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]

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]

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]

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 ???-??? IEEE Computer Society, 2019.
[doi:???] [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]

Core-Boosted Linear Search for Incomplete MaxSAT. Jeremias Berg, Emir Demirovíc, and Peter J. Stuckey. In Louis-Martin Rousseau and Kostas Stergiou, editors, Proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019),  volume 11494 of Lecture Notes in Computer Science, pages 39-56. Springer, 2019.

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]

Implicit Hitting Set Algorithms for Constraint Optimization. Paul Saikko. PhD thesis, University of Helsinki, 2019. 
[URN:ISBN:978-951-51-5669-3]

Reasoning over Assumption-Based Argumentation Frameworks via Answer Set Programming. Tuomo Lehtonen. Master's thesis, University of Helsinki, 2019.

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]

Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores. Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, and Alessandro Previti. In 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]

Abstract Dialectical Frameworks. An Overview. Gerhard Brewka, Stefan Ellmauthaler, Hannes Strass, Johannes P. Wallner, and Stefan Woltran. In Pietro Baroni, Dov Gabbay, Massimiliano Giacomin, and Leon van der Torre, editors, Chapter 5 of Handbook of Formal Argumentation, pages 237-285. College Publications, 2018.

Foundations of Implementations for Formal Argumentation. Federico Cerutti, Sarah A. Gaggl, Matthias Thimm, and Johannes P. Wallner. In Pietro Baroni, Dov Gabbay, Massimiliano Giacomin, and Leon van der Torre, editors, Chapter 14 of Handbook of Formal Argumentation, pages 688-767. College Publications, 2018.

Dynamic Programming on Tree Decompositions with D-FLAT. Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, and Stefan Woltran. KI - Künstliche Intelligenz  32(2–3):191-192, 2018.
[doi:10.1007/s13218-018-0531-2]

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 and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), pages 5209-5213. ijcai.org, 2018.
[IJCAI 2018 Best Sister Conference Paper Track]
[doi:10.24963/ijcai.2018/723] [pdf] [abstract/bibtex]

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. Thomas Linsbichler, Marco Maratea, Andreas Niskanen, Johannes P. Wallner, and Stefan Woltran. In Jerome Lang, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), pages 1905-1911. ijcai.org, 2018. 
[pdf]

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, Mario Alviano, Carmine Dodaro, 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 Jornal of Machine Learning Research, pages 344-355. JLMR.org, 2018.
[PGM 2018 Best Student Paper Award]
[pdf] [abstract/bibtex]

Structure Learning for Bayesian Networks over Labeled DAGs. Antti Hyttinen, Johan Pensar, Juha Kontinen, and Jukka Corander. In Vaclav Kratochvil and Milan Studeny, editors, Proceedings of the 9th International Conference on Probabilistic Graphical Models (PGM 2018), volume 72 of Proceedings of Jornal of Machine Learning Research, pages 133-144. JLMR.org, 2018.
[pdf/abstract]

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:???] [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]

ASP Programs with Groundings of Small Treewidth. Bernhard Bliem. In Flavio Ferrarotti and Stefan Woltran, editors, Proceedings of the 10th International Symposium on Foundations of Information and Knowledge Systems (FoIKS 2018), volume 10833 of Lecture Notes in Computer Science, pages 97-113. Springer, 2018.

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]

Solving Optimization Problems via Maximum Satisfiability: Encodings and Re-Encodings. Jeremias Berg. PhD thesis, University of Helsinki, 2018.
[URN:ISBN:978-951-51-4242-9]

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]

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]

Abstract Dialectical Frameworks. An Overview. Gerhard Brewka, Stefan Ellmauthaler, Hannes Strass, Johannes P. Wallner, and Stefan Woltran. Journal of Logics and their Applications, 4(8):2263–2317, 2017.

Foundations of Implementations for Formal Argumentation. Federico Cerutti, Sarah A. Gaggl, Matthias Thimm, and Johannes P. Wallner. Journal of Logics and their Applications, 4(8):2623–2705, 2017.

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.
[doi:???] [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. AAAI Press, 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. AAAI Press, 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.
[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.

Learning Score-Optimal Chordal Markov Networks via Branch and Bound. Kari Rantanen. Master's thesis, University of Helsinki, 2017.

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]

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] [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, editor, 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.
[Runner-up for ECAI 2016 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, 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]

Some Complexity Results on Inconsistency Measurement. Matthias Thimm and Johannes P. Wallner. In Chitta Baral, James P. Delgrande and Frank Wolter, editors, Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016), pages 114-124. AAAI Press, 2016.

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.

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), pages 216-227. JMLR.org, 2016.
[Publisher'sversion] [pdf] [abstract/bibtex]

A Logical Approach to Context-Specific Independence. Jukka Corander, Antti Hyttinen, Juha Kontinen, Johan Pensar, and Jouko Väänänen. In Åsa Hirvonen and Ruy J. G. B. de Queiroz, editors, Proceedings of the 23rd International Workshop on Logic, Language, Information, and Computation (WOLLIC 2016), volume 9803 of Lecture Notes in Computer Science, pages 165-182. Springer, 2016.

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 2016 Early Career Spotlight]
[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.

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]

Enforcement in Abstract Argumentation via Boolean Optimization. Andreas Niskanen. Master's thesis, University of Helsinki, 2016.

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]

Learning optimal Bayesian networks: A shortest path perspective. Changhe Yuan and Brandon Malone. Journal of Artificial Intelligence Research, 48:23–65, 2013.

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.

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

Predicting the Flexibility of Dynamic Loop Scheduling Using an Artificial Neural Network. Srishti Srivastava, Brandon Malone, Nitin Sukhija, Ioana Banicescu, and Florina Ciorba. Proceedings of the 12th International Symposium on Parallel and Distributed Computing (ISPDC 2013), IEEE Computer Society 2013.

Polycomb Group Gene OsFIE2 Regulates Rice (Oryza sativa) Seed Development and Grain Filling via a Mechanism Distinct from Arabidopsis. Babi Ramesh Reddy Nallamilli, Jian Zhang, Hana Mujahid, Brandon M. Malone, Susan M. Bridges, and Zhaohua Peng. PLoS Genetics, 9(3): e1003322, 2013.

Evaluating Anytime Algorithms for Learning Optimal Bayesian Networks. Brandon Malone and Changhe Yuan. 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.

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]

Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions. Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti Järvisalo (editors), Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions, 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]

Equivalence Checking of HWMCC 2012 Circuits. Armin Biere, Marijn J.H. Heule, Matti Järvisalo, and Norbert Manthey. In A. Balint, A. Belov, M.J.H. Heule, and M. Järvisalo (editors), 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 A. Balint, A. Belov, M.J.H. Heule, and M. Järvisalo (editors), 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.

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

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]  [pdf] [abstract/bibtex] Preliminary extended version: [arXiv:cs.DC/1205.2051]

A Bounded Error, Anytime Parallel Algorithm for Exact Bayesian Network Structure Learning. B. Malone and C. Yuan. In Proceedings of the 6th European Workshop on Probabilistic Graphical Models (PGM 2012), 2012.

An Improved Admissible Heuristic for Finding Optimal Bayesian Networks. C. Yuan and B. Malone, . In Proceedings of the 28th Conference on Uncertainty in Artificial Intelligence (UAI 2012), 2012.

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 Adrian Balint, Anton Belov, Daniel Diepold, Simon Gerber, 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 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 Adrian Balint, Anton Belov, Daniel Diepold, Simon Gerber, 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 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. In Adrian Balint, Anton Belov, Daniel Diepold, Simon Gerber, 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]