Software implementations by the group are available on a separate page under "Software".
Unifying Core-Guided and Implicit Hitting Set based Optimization. Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. In ???, editors, Proceedings of the
[
SAT-based Judgment Aggregation. Ari Conati, Andreas Niskanen, and Matti Järvisalo. In ???, editor, Proceedings of the
[
Certified Core-Guided MaxSAT Solving. Jeremias Berg, Bart Bogaerts, Jakob Nordström, Andy Oertel, and Dieter Vandesande. In ???, editors, Proceedings of the 29th International Conference on Automated Deduction (CADE-29), 2023.
Argumentative Reasoning in ASPIC+ under Incomplete Information. Daphne Odekerken, Tuomo Lehtonen, AnneMarie Borg, Johannes P. Wallner, and Matti Järvisalo. In ???, editors, Proceedings of the
[
Computational Approaches to Reasoning in Structured Argumentation. Tuomo Lehtonen. PhD thesis, University of Helsinki, 2023.
[
Judgment Aggregation via Boolean Satisfiability. Ari Conati. Master's thesis, University of Helsinki, 2023.
Incremental Maximum Satisfiability. Andreas Niskanen, Jeremias Berg, and Matti Järvisalo. In ???, editor, Proceedings of the
[
MaxSAT-Based Bi-Objective Boolean Optimization. Christoph Jabs, Jeremias Berg, Andreas Niskanen, and Matti Järvisalo. In ???, editor, Proceedings of the
[
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. In ???, editor, Proceedings of the
[
Clause Redundancy and Preprocessing in Maximum Satisfiability.
Hannes Ihalainen, Jeremias Berg, and Matti Järvisalo. In ???, editors, Proceedings of the
[
Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework. Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo. In ???, editors, Proceedings of the
[
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
[
Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation. Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo. In ???, editors, Proceedings of the
[
Refined Core Relaxations for Core-Guided Maximum Satisfiability Algorithms. Hannes Ihalainen. Master's thesis, University of Helsinki, 2022.
A Maximum Satisfiability Based Approach to Bi-Objective Boolean Optimization. Christoph Jabs. Master's thesis, University of Helsinki, 2022.
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.
[
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.
[
Maximum Satisfiability. Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (editors),
[
Preprocessing in SAT Solving. Armin Biere, Matti Järvisalo, and Benjamin Kiesl. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (editors),
[
Acceptance in Incomplete Argumentation Frameworks. Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, and Jörg Rothe.
[
Declarative Algorithms and Complexity Results for Assumption-Based Argumentation. Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
[
SAT Competition 2020. Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo, and Martin Suda.
[
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation. Tuomo Lehtonen, Johannes P. Wallner, and Matti Järvisalo.
[
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
[
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters. Tuukka Korhonen and Matti Järvisalo. In Laurent D. Michel, editor, Proceedings of the
[
Pseudo-Boolean Optimization by Implicit Hitting Sets. Pavel Smirnov, Jeremias Berg, and Matti Järvisalo. In Laurent D. Michel, editor, Proceedings of the
[
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
[
A Single-Exponential Time 2-Approximation Algorithm for Treewidth. Tuukka Korhonen. In Proceedings of the 62nd Annual Symposium on Foundations of Computer Science (FOCS 2022), pages 184-192. IEEE Press, 2021.
Lower Bounds on Dynamic Programming for Maximum Weight Independent Set. Tuukka Korhonen. In Nikhil Bansal and Emanuela Merelli and James Worrell, editors, Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics, pages 87:1-87:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.
[
Optimization Algorithms for Learning Graphical Model Structures. Kari Rantanen. PhD thesis, University of Helsinki, 2021.
[
Proceedings of SAT Competition 2021: Solver and Benchmark Descriptions. Tomas Balyo, 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.
[
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.
[
Discovering Causal Graphs with Cycles and Latent Confounders: An Exact Branch-and-Bound Approach. Kari Rantanen, Antti Hyttinen, and Matti Järvisalo.
[
The Impact of Treewidth on Grounding and Solving of Answer Set Programs. Bernhard Bliem, Michael Morak, Marius Moldovan, and Stefan Woltran.
[
Controllability of Control Argumentation Frameworks. Andreas Niskanen, Daniel Neugebauer, and Matti Järvisalo. In Proceedings of the
[
Finding Most Compatible Phylogenetic Trees over Multi-State Characters. Tuukka Korhonen and Matti Järvisalo. In Proceedings of the
[
Deciding Acceptance in Incomplete Argumentation Frameworks. Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, and Jörg Rothe. In Proceedings of the
[
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
[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
[
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
[
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
[
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
[
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
[
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
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
[
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
[
μ-toksia: An Efficient Abstract Argumentation Reasoner. Andreas Niskanen and Matti Järvisalo. In Diego Calvanese, Esra Erdem, and Michael Thielscher, editors, Proceedings of the
[
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
[
Finding Optimal Triangulations Parameterized by Edge Clique Cover. Tuukka Korhonen. In Yixin Cao and Marcin Pilipczuk, editors, Proceeding of the
[
PACE Solver Description: SMS. Tuukka Korhonen. In Yixin Cao and Marcin Pilipczuk, editors, Proceeding of the
[
Computational Approaches to Dynamics and Uncertainty in Abstract Argumentation. Andreas Niskanen. PhD thesis, University of Helsinki, 2020.
[
Finding Optimal Tree Decompositions. Tuukka Korhonen. Master's thesis, University of Helsinki, 2020.
[
Finding Periodic Apartments: A Computational Study of Hyperbolic Buildings. Jarkko Savela. Master's thesis, University of Helsinki, 2020.
[
Preprocessing and Stochastic Local Search in Maximum Satisfiability. Marcus Leivo. Master's thesis, University of Helsinki, 2020.
[
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.
[
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.
[
Synthesizing Argumentation Frameworks from Examples. Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo.
[
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. Tuukka Korhonen, Jeremias Berg, and Matti Järvisalo.
[
Towards Transformational Creation of Novel Songs. Jukka M. Toivanen, Matti Järvisalo, Olli Alm, Dan Ventura, Martti Vainio, and Hannu Toivonen.
[
MaxSAT Evaluation 2018: New Developments and Detailed Results. Fahiem Bacchus, Matti Järvisalo, and Ruben Martins.
[
SAT Competition 2018. Marijn J. H. Heule, Matti Järvisalo, and Martin Suda.
[
Enumerating Potential Maximal Cliques via SAT and ASP. Tuukka Korhonen, Jeremias Berg, and Matti Järvisalo. In Sarit Kraus, editor, Proceedings of the
[
Centrality Heuristics for Exact Model Counting. Bernhard Bliem and Matti Järvisalo. In Proceedings of the
[
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
[
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
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
[
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
[
Implicit Hitting Set Algorithms for Constraint Optimization. Paul Saikko. PhD thesis, University of Helsinki, 2019.
[
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.
[
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.
[
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.
[
Cautious Reasoning in ASP via Minimal models and Unsatisfiable Cores. Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, and Alessandro Previti. In
[
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.
[
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.
[
Reduced Cost Fixing for Maximum Satisfiability. Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko. In Jerome Lang, editor, Proceedings of the
[IJCAI 2018 Best Sister Conference Paper Track]
[
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
[
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
[
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
[
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
[
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
[PGM 2018 Best Student Paper Award]
[
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
[
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
[
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
[
ASP Programs with Groundings of Small Treewidth. Bernhard Bliem. In Flavio Ferrarotti and Stefan Woltran, editors, Proceedings of the
SAT for Argumentation. Matti Järvisalo. In Matthias Thimm, Federico Cerutti, and Mauro Vallati, editors, Proceedings of the
[SAFA 2018 keynote talk extended abstract]
[
Solving Optimization Problems via Maximum Satisfiability: Encodings and Re-Encodings. Jeremias Berg. PhD thesis, University of Helsinki, 2018.
[
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.
[
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.
[
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.
[
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. Johannes P. Wallner, Andreas Niskanen, and Matti Järvisalo.
[
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity. James Cussens, Matti Järvisalo, Janne H. Korhonen, and Mark Bartlett.
[
Cost-Optimal Constrained Correlation Clustering via Weighted Partial Maximum Satisfiability. Jeremias Berg and Matti Järvisalo.
[
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
[
A Core-Guided Approach to Learning Optimal Causal Graphs. Antti Hyttinen, Paul Saikko, and Matti Järvisalo. In Carles Sierra, editor, Proceedings of the
[
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
[
Weight-Aware Core Extraction in SAT-Based MaxSAT Solving. Jeremias Berg and Matti Järvisalo. In J. Christopher Beck, editor, Proceedings of the
[
Reduced Cost Fixing in MaxSAT. Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko. In J. Christopher Beck, editor, Proceedings of the
[CP 2017 Distinguished Paper Award]
[
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
[
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
[
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
[
On Computing Generalized Backbones. Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, and Joao Marques-Silva. In Proceedings of the
[
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
[
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
[
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,
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.
[
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.
[
Separating OR, SUM, and XOR circuits. Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, and Janne H. Korhonen.
[
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.
[
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.
[
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
[
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
[Runner-up for ECAI 2016 Best Student Paper Award]
[
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.
[
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.
[
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
[
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
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
[
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
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
[
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
Boolean Satisfiability and Beyond: Algorithms, Analysis, and AI Applications. Matti Järvisalo. In Subbarao Kambhampati, editor, Proceedings of the
[IJCAI 2016 Early Career Spotlight]
[
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
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.
[
Enforcement in Abstract Argumentation via Boolean Optimization. Andreas Niskanen. Master's thesis, University of Helsinki, 2016.
Clause Elimination for SAT and QSAT. Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, and Armin Biere.
[
Overview and Analysis of the SAT Challenge 2012 Solver Competition. Adrian Balint, Anton Belov, Matti Järvisalo, and Carsten Sinz.
[
Improved Answer-Set Programming Encodings for Abstract Argumentation. Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, and Stefan Woltran.
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.
[
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
[
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
[
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
[
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
[
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
[
Re-using Auxiliary Variables for MaxSAT Preprocessing. Jeremias Berg, Paul Saikko, and Matti Järvisalo. In Proceedings of the
[
MaxSAT-Based Cutting Planes for Learning Graphical Models. Paul Saikko, Brandon Malone, and Matti Järvisalo. In Laurent Michel, editor, Proceedings of the
[
Abstract Solvers for Dung's Argumentation Frameworks. Rémi Brochenin, Thomas Linsbichler, Marco Maratea, Johannes P. Wallner, and Stefan Woltran. In Elizabeth Black, Sanjay Modgil, and Nir Oren, editors, Proceedings of the
Applications of MaxSAT in Data Analysis. Jeremias Berg, Antti Hyttinen, and Matti Järvisalo. In ???, editors, Proceedings of the
[
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 Serana Villata, editors,
Re-implementing and Extending a Hybrid SAT-IP Approach to Maximum Satisfiability. Paul Saikko. Master's thesis, University of Helsinki, 2015.
[
Complexity-Sensitive Decision Procedures for Abstract Argumentation. Wolfgang Dvořák, Matti Järvisalo, Johannes Peter Wallner, and Stefan Woltran.
[
SAT-Based Approaches to Treewidth Computation: An Evaluation. Jeremias Berg and Matti Järvisalo. In Proceedings of the
[
Answer Set Solver Backdoors. Emilia Oikarinen and Matti Järvisalo. In Eduardo Ferme and Joao Leite, editors, Proceedings of the
[
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
[
Finding Optimal Bayesian Network Structures with Constraints Learned from Data. Xiannian Fan, Brandon Malone, and Changhe Yuan. In Jin Tian and Nevin L. Zhang, editors, Proceedings of the
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
[
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
[
Tightening Bounds for Bayesian Network Structure Learning. Xiannian Fan, Changhe Yuan, and Brandon Malone. In Carla E. Brodley and Peter Stone, editors, Proceedings of the
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
[
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
[
A Depth-First Branch and Bound Algorithm for Learning Optimal Bayesian Networks. Brandon M. Malone, and Changhe Yuan. In Madalina Croitoru, Sebastian Rudolph, Stefan Woltran, and Christophe Gonzales, editors, Revised Selected Papers of the Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR 2013), volume 8323 of Lecture Notes in Computer Science, pages 111-122. Springer, 2014.
Portfolio-based Selection of Robust Dynamic Loop Scheduling Algorithms using Machine Learning. Nitin Sukhija, Brandon Malone, Srishti Srivastava, Ioana Banicescu, and Florina Ciorba. In IEEE International Symposium on Parallel & Distributed Processing Workshops, pages 1638-1647. IEEE, 2014.
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.
[
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.
[
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.
[
Cost-Optimal Correlation Clustering via Partial Maximum Satisfiability. Jeremias Berg. Master's thesis, University of Helsinki, 2014.
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. [
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
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
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
[
Revisiting Hyper Binary Resolution. Marijn Heule, Matti Järvisalo, and Armin Biere. In Carla Gomes and Meinolf Sellmann, editors, Proceedings of the
[
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
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),
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. [
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. [
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. [
Simulating Circuit-Level Simplifications on CNF. Matti Järvisalo, Armin Biere, and Marijn Heule.
[
The International SAT Solver Competitions. Matti Järvisalo, Daniel Le Berre, Olivier Roussel, and Laurent Simon.
[
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
[
Inprocessing Rules. Matti Järvisalo, Marijn Heule, and Armin Biere. In Bernhard Gramlich, Dale Miller, and Uli Sattler, editors, Proceedings of the
[
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]
[
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
[
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
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.
[
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
[
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 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
[