Publications

This following list includes publications of the Constraint Reasoning and Optimization group starting from year 2012. Software implementations by the group are available on a separate page under "Software".

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]

Towards Transformational Creation of Novel Songs. Jukka M. Toivanen, Matti Järvisalo, Olli Alm, Dan Ventura, Martti Vainio, and Hannu Toivonen. Connection Science, in press (2018).
[doi:10.1080/09540091.2018.1443320] [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 ???-???. College Publications, 2018 (to appear).

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 ???-???. College Publications, 2018 (to appear).

Reduced Cost Fixing for Maximum Satisfiability. Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, and Paul Saikko. In ???, editor, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), pages ???-???. ijcai.org, 2018.
[IJCAI 2018 Best Sister Conference Paper Track]
[doi:???] [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 ???, editors, Proceedings of the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), pages ???-???. 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 ???, editors, Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), pages ???-???. AAAI Press, 2018.
[pdf] [abstract/bibtex]

Extension Enforcement under Grounded Semantics in Abstract Argumentation. Andreas Niskanen, Johannes P. Wallner, and Matti Järvisalo. In ???, editors, Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), pages ???-???. AAAI Press, 2018.
[pdf] [abstract/bibtex]

Learning Optimal Causal Graphs with Exact Search. Kari Rantanen, Antti Hyttinen, and Matti Järvisalo. In ???, editors, Proceedings of the 9th International Conference on Probabilistic Graphical Models (PGM 2018), volume ??? of Proceedings of Jornal of Machine Learning Research, pages ???-???. JLMR.org, 2018.
[doi:???] [pdf] [abstract/bibtex]

Structure Learning for Bayesian Networks over Labeled DAGs. Antti Hyttinen, Johan Pensar, Juha Kontinen, and Jukka Corander. In ???, editors, Proceedings of the 9th International Conference on Probabilistic Graphical Models (PGM 2018), volume ??? of Proceedings of Jornal of Machine Learning Research, pages ???-???. JLMR.org, 2018.

SAT-based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks. Tuomo Lehtonen, Andreas Niskanen, and Matti Järvisalo. In ???, editors, Proceedings of the 7th International Conference on Computational Models of Argument (COMMA 2018), volume ??? of Frontiers in Artificial Intelligence and Applications, pages ???-???. 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.

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

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

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]

Improved Answer-Set Programming Encodings for Abstract Argumentation. Sarah Alice Gaggl, Norbert Manthey, Alessandro Ronca, Johannes Peter Wallner, and Stefan Woltran. Theory and Practice of Logic Programming 15(4-5):434-448, 2015.

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]

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 3rd Workshop on Theory and Applications of Formal Argumentation (TAFA 2015), revised selected papers, volume 9524 of Lecture Notes in Computer Science, pages 40-58. Springer, 2015.

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

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, System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA 2015), 2015. [pdf]

Re-implementing and Extending a Hybrid SAT-IP Approach to Maximum Satisfiability. Paul Saikko. Master's thesis, University of Helsinki, 2015.
[handle:10138/159186]

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

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]

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]

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 30th Conference on Uncertainty in Artificial Intelligence (UAI 2014), pages 200-209. AUAI Press, 2014.

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]

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 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pages 2439-2445. AAAI Press, 2014.

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]

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]

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.
[handle:10138/135571]

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]

Cost-Optimal Correlation Clustering via Partial Maximum Satisfiability. Jeremias Berg. Master's thesis, University of Helsinki, 2014.
[handle:10138/45392]

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]