Matti Järvisalo

185 papers A* 39A 48B 18C 4Misc 1Journal 54Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach. AAAI Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2026	A*	`conf`	Ordered Objectives in Maximum Satisfiability. AAAI Jeremias Berg, André Schidler, Matti Järvisalo
2026	A*	`conf`	Symmetry Breaking for Inductive Logic Programming. AAAI Andrew Cropper, David M. Cerna, Matti Järvisalo
2025	J	`jnl`	Argumentative Reasoning in ASPIC+ under Incomplete Information. J. Artif. Intell. Res. Daphne Odekerken, Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2025	—	`conf`	Certifying Pareto-Optimality in Multi Objective Maximum Satisfiability. TACAS (2) Christoph Jabs, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2025	J	`jnl`	Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability. CoRR Christoph Jabs, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2025	A	`conf`	Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. AAMAS Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo
2025	A*	`conf`	Cost-Optimal Delete-Free Classical Planning via Maximum Satisfiability. KR Masood Feyzbakhsh Rankooh, Andreas Niskanen, Matti Järvisalo
2025	J	`jnl`	Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach. CoRR Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo
2025	—	`conf`	Engineering and Evaluating Multi-objective Pseudo-Boolean Optimizers. JELIA (1) Christoph Jabs, Jeremias Berg, Matti Järvisalo
2025	J	`jnl`	ICCMA 2023: 5th International Competition on Computational Models of Argumentation. Artif. Intell. Matti Järvisalo, Tuomo Lehtonen, Andreas Niskanen
2025	A*	`conf`	Reasoning in Assumption-Based Argumentation via SAT. KR Andreas Niskanen, Masood Feyzbakhsh Rankooh, Tuomo Lehtonen, Matti Järvisalo
2025	A	`conf`	Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets. CP Hannes Ihalainen, Jeremias Berg, Matti Järvisalo, Bart Bogaerts
2025	J	`jnl`	Symmetry breaking for inductive logic programming. CoRR Andrew Cropper, David M. Cerna, Matti Järvisalo
2024	—	`conf`	Certified MaxSAT Preprocessing. IJCAR (1) Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström
2024	J	`jnl`	Certified MaxSAT Preprocessing. CoRR Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Jakob Nordström
2024	A	`conf`	Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. ECAI Ari Conati, Andreas Niskanen, Ronald de Haan, Matti Järvisalo
2024	A*	`conf`	Complexity Results and Algorithms for Preferential Argumentative Reasoning in ASPIC+. KR Tuomo Lehtonen, Daphne Odekerken, Johannes P. Wallner, Matti Järvisalo
2024	—	`conf`	Core Boosting in SAT-Based Multi-objective Optimization. CPAIOR (2) Christoph Jabs, Jeremias Berg, Matti Järvisalo
2024	J	`jnl`	Declarative Approaches to Outcome Determination in Judgment Aggregation. J. Artif. Intell. Res. Ari Conati, Andreas Niskanen, Matti Järvisalo
2024	J	`jnl`	From Single-Objective to Bi-Objective Maximum Satisfiability Solving. J. Artif. Intell. Res. Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo
2024	A*	`conf`	Learning Big Logical Rules by Joining Small Rules. IJCAI Céline Hocquette, Andreas Niskanen, Rolf Morel, Matti Järvisalo, Andrew Cropper
2024	A*	`conf`	Learning MDL Logic Programs from Noisy Data. AAAI Céline Hocquette, Andreas Niskanen, Matti Järvisalo, Andrew Cropper
2024	J	`jnl`	Learning big logical rules by joining small rules. CoRR Céline Hocquette, Andreas Niskanen, Rolf Morel, Matti Järvisalo, Andrew Cropper
2024	A	`conf`	SAT-Based Approaches to Reasoning in Choice Logics. ECAI Tuomo Lehtonen, Andreas Niskanen, Matti Järvisalo
2024	J	`jnl`	Unifying SAT-Based Approaches to Maximum Satisfiability Solving. J. Artif. Intell. Res. Hannes Ihalainen, Jeremias Berg, Matti Järvisalo
2023	A*	`conf`	Argumentative Reasoning in ASPIC+ under Incomplete Information. KR Daphne Odekerken, Tuomo Lehtonen, Annemarie Borg, Johannes P. Wallner, Matti Järvisalo
2023	B	`conf`	Computing MUS-Based Inconsistency Measures. JELIA Isabelle Kuhlmann, Andreas Niskanen, Matti Järvisalo
2023	—	`conf`	Design of ICCMA 2023, 5th International Competition on Computational Models of Argumentation: A Preliminary Report (invited paper). Arg&App Matti Järvisalo, Tuomo Lehtonen, Andreas Niskanen
2023	J	`jnl`	Learning MDL logic programs from noisy data. CoRR Céline Hocquette, Andreas Niskanen, Matti Järvisalo, Andrew Cropper
2023	A	`conf`	MaxSAT-Based Inconsistency Measurement. ECAI Andreas Niskanen, Isabelle Kuhlmann, Matthias Thimm, Matti Järvisalo
2023	A	`conf`	Oracle-Based Local Search for Pseudo-Boolean Optimization. ECAI Ashlin Iser, Jeremias Berg, Matti Järvisalo
2023	A	`conf`	Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. CP Christoph Jabs, Jeremias Berg, Hannes Ihalainen, Matti Järvisalo
2023	—	`ed.`	Proceedings of the 14th International Workshop on Pragmatics of SAT co-located with the 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023), Alghero, Italy, July 4, 2023. POS@SAT Matti Järvisalo, Daniel Le Berre
2023	A	`conf`	SAT-based Judgment Aggregation. AAMAS Ari Conati, Andreas Niskanen, Matti Järvisalo
2023	J	`jnl`	SharpSAT-TD in Model Counting Competitions 2021-2023. CoRR Tuukka Korhonen, Matti Järvisalo
2023	A*	`conf`	Unifying Core-Guided and Implicit Hitting Set Based Optimization. IJCAI Hannes Ihalainen, Jeremias Berg, Matti Järvisalo
2022	C	`conf`	Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation. COMMA Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2022	A	`conf`	Clause Redundancy and Preprocessing in Maximum Satisfiability. IJCAR Hannes Ihalainen, Jeremias Berg, Matti Järvisalo
2022	B	`conf`	Computing Smallest MUSes of Quantified Boolean Formulas. LPNMR Andreas Niskanen, Jere Mustonen, Jeremias Berg, Matti Järvisalo
2022	A*	`conf`	Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism. KR Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2022	A	`conf`	Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. SAT Pavel Smirnov, Jeremias Berg, Matti Järvisalo
2022	A	`conf`	Incremental Maximum Satisfiability. SAT Andreas Niskanen, Jeremias Berg, Matti Järvisalo
2022	A	`conf`	MaxSAT-Based Bi-Objective Boolean Optimization. SAT Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo
2021	J	`jnl`	Acceptance in incomplete argumentation frameworks. Artif. Intell. Dorothea Baumeister, Matti Järvisalo, Daniel Neugebauer, Andreas Niskanen, Jörg Rothe
2021	J	`jnl`	Declarative Algorithms and Complexity Results for Assumption-Based Argumentation. J. Artif. Intell. Res. Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2021	A	`conf`	Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. CP Andreas Niskanen, Jeremias Berg, Matti Järvisalo
2021	J	`jnl`	Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation. CoRR Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2021	J	`jnl`	Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation. Theory Pract. Log. Program. Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2021	A	`conf`	Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). CP Tuukka Korhonen, Matti Järvisalo
2021	A	`conf`	Maximal ancestral graph structure learning via exact search. UAI Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2021	—	`ch.`	Maximum Satisfiability. Handbook of Satisfiability Fahiem Bacchus, Matti Järvisalo, Ruben Martins
2021	—	`ch.`	Preprocessing in SAT Solving. Handbook of Satisfiability Armin Biere, Matti Järvisalo, Benjamin Kiesl
2021	A	`conf`	Pseudo-Boolean Optimization by Implicit Hitting Sets. CP Pavel Smirnov, Jeremias Berg, Matti Järvisalo
2021	A	`conf`	Refined Core Relaxation for Core-Guided MaxSAT Solving. CP Hannes Ihalainen, Jeremias Berg, Matti Järvisalo
2021	J	`jnl`	SAT Competition 2020. Artif. Intell. Nils Froleyks, Marijn Heule, Ashlin Iser, Matti Järvisalo, Martin Suda
2020	A	`conf`	Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach. ECAI Andreas Niskanen, Matti Järvisalo
2020	A*	`conf`	An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework. KR Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2020	A*	`conf`	Controllability of Control Argumentation Frameworks. IJCAI Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo
2020	A*	`conf`	Deciding Acceptance in Incomplete Argumentation Frameworks. AAAI Andreas Niskanen, Daniel Neugebauer, Matti Järvisalo, Jörg Rothe
2020	J	`jnl`	Discovering causal graphs with cycles and latent confounders: An exact branch-and-bound approach. Int. J. Approx. Reason. Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2020	A*	`conf`	Finding Most Compatible Phylogenetic Trees over Multi-State Characters. AAAI Tuukka Korhonen, Matti Järvisalo
2020	B	`conf`	Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. LPAR Jarkko Savela, Emilia Oikarinen, Matti Järvisalo
2020	A	`conf`	Learning Chordal Markov Networks via Stochastic Local Search. ECAI Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2020	—	`conf`	Learning Optimal Cyclic Causal Graphs from Interventional Data. PGM Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2020	A	`conf`	Preprocessing in Incomplete MaxSAT Solving. ECAI Marcus Leivo, Jeremias Berg, Matti Järvisalo
2020	A*	`conf`	Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation. KR Andreas Niskanen, Matti Järvisalo
2020	A	`conf`	Strong Refinements for Hard Problems in Argumentation Dynamics. ECAI Andreas Niskanen, Matti Järvisalo
2020	A*	`conf`	µ-toksia: An Efficient Abstract Argumentation Reasoner. KR Andreas Niskanen, Matti Järvisalo
2019	B	`conf`	Centrality Heuristics for Exact Model Counting. ICTAI Bernhard Bliem, Matti Järvisalo
2019	A*	`conf`	Enumerating Potential Maximal Cliques via SAT and ASP. IJCAI Tuukka Korhonen, Jeremias Berg, Matti Järvisalo
2019	J	`jnl`	MaxSAT Evaluation 2018: New Developments and Detailed Results. J. Satisf. Boolean Model. Comput. Fahiem Bacchus, Matti Järvisalo, Ruben Martins
2019	B	`conf`	Preprocessing Argumentation Frameworks via Replacement Patterns. JELIA Wolfgang Dvorák, Matti Järvisalo, Thomas Linsbichler, Andreas Niskanen, Stefan Woltran
2019	—	`ed.`	Proceedings of Pragmatics of SAT 2015, Austin, Texas, USA, September 23, 2015 / Pragmatics of SAT 2018, Oxford, UK, July 7, 2018. POS@SAT Daniel Le Berre, Matti Järvisalo
2019	A*	`conf`	Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings. AAAI Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2019	J	`jnl`	SAT Competition 2018. J. Satisf. Boolean Model. Comput. Marijn J. H. Heule, Matti Järvisalo, Martin Suda
2019	J	`jnl`	Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. ACM J. Exp. Algorithmics Tuukka Korhonen, Jeremias Berg, Matti Järvisalo
2019	J	`jnl`	Synthesizing Argumentation Frameworks from Examples. J. Artif. Intell. Res. Andreas Niskanen, Johannes P. Wallner, Matti Järvisalo
2019	J	`jnl`	Towards transformational creation of novel songs. Connect. Sci. Jukka M. Toivanen, Matti Järvisalo, Olli Alm, Dan Ventura, Martti Vainio, Hannu Toivonen
2019	B	`conf`	Unifying Reasoning and Core-Guided Search for Maximum Satisfiability. JELIA Jeremias Berg, Matti Järvisalo
2018	A*	`conf`	A Hybrid Approach to Optimization in Answer Set Programming. KR Paul Saikko, Carmine Dodaro, Mario Alviano, Matti Järvisalo
2018	Misc	`conf`	A preference-based approach to backbone computation with application to argumentation. SAC Alessandro Previti, Matti Järvisalo
2018	—	`conf`	Applications of MaxSAT in Data Analysis. POS@SAT Jeremias Berg, Antti Hyttinen, Matti Järvisalo
2018	J	`jnl`	Cautious reasoning in ASP via minimal models and unsatisfiable cores. CoRR Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, Alessandro Previti
2018	J	`jnl`	Cautious reasoning in ASP via minimal models and unsatisfiable cores. Theory Pract. Log. Program. Mario Alviano, Carmine Dodaro, Matti Järvisalo, Marco Maratea, Alessandro Previti
2018	J	`jnl`	Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction. Mach. Learn. Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
2018	A*	`conf`	Extension Enforcement under Grounded Semantics in Abstract Argumentation. KR Andreas Niskanen, Johannes P. Wallner, Matti Järvisalo
2018	—	`conf`	Learning Optimal Causal Graphs with Exact Search. PGM Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2018	A*	`conf`	Premise Set Caching for Enumerating Minimal Correction Subsets. AAAI Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva
2018	A*	`conf`	Reduced Cost Fixing for Maximum Satisfiability. IJCAI Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko
2018	—	`conf`	SAT for Argumentation. SAFA Matti Järvisalo
2018	C	`conf`	SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks. COMMA Tuomo Lehtonen, Andreas Niskanen, Matti Järvisalo
2017	A*	`conf`	A Core-Guided Approach to Learning Optimal Causal Graphs. IJCAI Antti Hyttinen, Paul Saikko, Matti Järvisalo
2017	J	`jnl`	A constraint optimization approach to causal discovery from subsampled time series data. Int. J. Approx. Reason. Antti Hyttinen, Sergey M. Plis, Matti Järvisalo, Frederick Eberhardt, David Danks
2017	—	`conf`	AS-ASL: Algorithm Selection with Auto-sklearn. OASC Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
2017	A*	`conf`	Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract). IJCAI James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
2017	J	`jnl`	Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity. J. Artif. Intell. Res. James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
2017	J	`jnl`	Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. J. Artif. Intell. Res. Johannes P. Wallner, Andreas Niskanen, Matti Järvisalo
2017	J	`jnl`	Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability. Artif. Intell. Jeremias Berg, Matti Järvisalo
2017	C	`conf`	From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning. ECSQARU Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
2017	A	`conf`	Improving MCS Enumeration via Caching. SAT Alessandro Previti, Carlos Mencía, Matti Järvisalo, João Marques-Silva
2017	—	`conf`	Learning Chordal Markov Networks via Branch and Bound. NIPS Kari Rantanen, Antti Hyttinen, Matti Järvisalo
2017	A	`conf`	MaxPre: An Extended MaxSAT Preprocessor. SAT Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo
2017	A	`conf`	Minimum-Width Confidence Bands via Constraint Optimization. CP Jeremias Berg, Emilia Oikarinen, Matti Järvisalo, Kai Puolamäki
2017	B	`conf`	On Computing Generalized Backbones. ICTAI Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, João Marques-Silva
2017	A	`conf`	Reduced Cost Fixing in MaxSAT. CP Fahiem Bacchus, Antti Hyttinen, Matti Järvisalo, Paul Saikko
2017	A*	`conf`	SAT Competition 2016: Recent Developments. AAAI Tomás Balyo, Marijn J. H. Heule, Matti Järvisalo
2017	A	`conf`	Weight-Aware Core Extraction in SAT-Based MaxSAT Solving. CP Jeremias Berg, Matti Järvisalo
2016	J	`jnl`	Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity. CoRR James Cussens, Matti Järvisalo, Janne H. Korhonen, Mark Bartlett
2016	A*	`conf`	Boolean Satifiability and Beyond: Algorithms, Analysis, and AI Applications. IJCAI Matti Järvisalo
2016	—	`conf`	Causal Discovery from Subsampled Time Series Data by Constraint Optimization. Probabilistic Graphical Models Antti Hyttinen, Sergey M. Plis, Matti Järvisalo, Frederick Eberhardt, David Danks
2016	J	`jnl`	Causal Discovery from Subsampled Time Series Data by Constraint Optimization. CoRR Antti Hyttinen, Sergey M. Plis, Matti Järvisalo, Frederick Eberhardt, David Danks
2016	A*	`conf`	Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. AAAI Johannes P. Wallner, Andreas Niskanen, Matti Järvisalo
2016	A	`conf`	Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving. CP Jeremias Berg, Matti Järvisalo
2016	A*	`conf`	Implicit Hitting Set Algorithms for Reasoning Beyond NP. KR Paul Saikko, Johannes P. Wallner, Matti Järvisalo
2016	A	`conf`	LMHS: A SAT-IP Hybrid MaxSAT Solver. SAT Paul Saikko, Jeremias Berg, Matti Järvisalo
2016	A*	`conf`	Optimal Status Enforcement in Abstract Argumentation. IJCAI Andreas Niskanen, Johannes P. Wallner, Matti Järvisalo
2016	B	`conf`	Pakota: A System for Enforcement in Abstract Argumentation. JELIA Andreas Niskanen, Johannes P. Wallner, Matti Järvisalo
2016	J	`jnl`	Separating OR, SUM, and XOR circuits. J. Comput. Syst. Sci. Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2016	A	`conf`	Subsumed Label Elimination for Maximum Satisfiability. ECAI Jeremias Berg, Paul Saikko, Matti Järvisalo
2016	J	`jnl`	Synchronous counting and computational algorithm design. J. Comput. Syst. Sci. Danny Dolev, Keijo Heljanko, Matti Järvisalo, Janne H. Korhonen, Christoph Lenzen, Joel Rybicki, Jukka Suomela, Siert Wieringa
2016	A	`conf`	Synthesizing Argumentation Frameworks from Examples. ECAI Andreas Niskanen, Johannes P. Wallner, Matti Järvisalo
2015	J	`jnl`	Clause Elimination for SAT and QSAT. J. Artif. Intell. Res. Marijn Heule, Matti Järvisalo, Florian Lonsing, Martina Seidl, Armin Biere
2015	A*	`conf`	Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). IJCAI Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
2015	A	`conf`	Do-calculus when the True Graph Is Unknown. UAI Antti Hyttinen, Frederick Eberhardt, Matti Järvisalo
2015	A	`conf`	Impact of Learning Strategies on the Quality of Bayesian Networks: An Empirical Evaluation. UAI Brandon M. Malone, Matti Järvisalo, Petri Myllymäki
2015	A*	`conf`	Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT. IJCAI Jeremias Berg, Paul Saikko, Matti Järvisalo
2015	A	`conf`	Learning Optimal Chain Graphs with Answer Set Programming. UAI Dag Sonntag, Matti Järvisalo, José M. Peña, Antti Hyttinen
2015	B	`conf`	MaxSAT-Based Cutting Planes for Learning Graphical Models. CPAIOR Paul Saikko, Brandon M. Malone, Matti Järvisalo
2015	J	`jnl`	Overview and analysis of the SAT Challenge 2012 solver competition. Artif. Intell. Adrian Balint, Anton Belov, Matti Järvisalo, Carsten Sinz
2015	B	`conf`	Re-using Auxiliary Variables for MaxSAT Preprocessing. ICTAI Jeremias Berg, Paul Saikko, Matti Järvisalo
2015	J	`jnl`	Weak models of distributed computing, with connections to modal logic. Distributed Comput. Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2014	B	`conf`	Answer Set Solver Backdoors. JELIA Emilia Oikarinen, Matti Järvisalo
2014	J	`jnl`	Complexity-sensitive decision procedures for abstract argumentation. Artif. Intell. Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
2014	A	`conf`	Conditional Lower Bounds for Failed Literals and Related Techniques. SAT Matti Järvisalo, Janne H. Korhonen
2014	A	`conf`	Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming. UAI Antti Hyttinen, Frederick Eberhardt, Matti Järvisalo
2014	A	`conf`	Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability. AISTATS Jeremias Berg, Matti Järvisalo, Brandon M. Malone
2014	A*	`conf`	Optimal Neighborhood Preserving Visualization by Maximum Satisfiability. AAAI Kerstin Bunte, Matti Järvisalo, Jeremias Berg, Petri Myllymäki, Jaakko Peltonen, Samuel Kaski
2014	A*	`conf`	Predicting the Hardness of Learning Bayesian Networks. AAAI Brandon M. Malone, Kustaa Kangas, Matti Järvisalo, Mikko Koivisto, Petri Myllymäki
2014	B	`conf`	SAT-Based Approaches to Treewidth Computation: An Evaluation. ICTAI Jeremias Berg, Matti Järvisalo
2013	A	`conf`	Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure. UAI Antti Hyttinen, Patrik O. Hoyer, Frederick Eberhardt, Matti Järvisalo
2013	J	`jnl`	Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure. CoRR Antti Hyttinen, Patrik O. Hoyer, Frederick Eberhardt, Matti Järvisalo
2013	A	`conf`	Formula Preprocessing in MUS Extraction. TACAS Anton Belov, Matti Järvisalo, João Marques-Silva
2013	C	`conf`	Harnessing Constraint Programming for Poetry Composition. ICCC Jukka M. Toivanen, Matti Järvisalo, Hannu Toivonen
2013	—	`conf`	Optimal Correlation Clustering via MaxSAT. ICDM Workshops Jeremias Berg, Matti Järvisalo
2013	B	`conf`	Revisiting Hyper Binary Resolution. CPAIOR Marijn Heule, Matti Järvisalo, Armin Biere
2013	J	`jnl`	Separating OR, SUM, and XOR Circuits CoRR Magnus Find, Mika Göös, Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2013	A	`ed.`	Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings SAT Matti Järvisalo, Allen Van Gelder
2012	A*	`conf`	Complexity-Sensitive Decision Procedures for Abstract Argumentation. KR Wolfgang Dvorák, Matti Järvisalo, Johannes Peter Wallner, Stefan Woltran
2012	A	`conf`	Finding Efficient Circuits for Ensemble Computation. SAT Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen
2012	A	`conf`	Inprocessing Rules. IJCAR Matti Järvisalo, Marijn Heule, Armin Biere
2012	A	`conf`	Relating Proof Complexity Measures and Practical Hardness of SAT. CP Matti Järvisalo, Arie Matsliah, Jakob Nordström, Stanislav Zivný
2012	J	`jnl`	Simulating Circuit-Level Simplifications on CNF. J. Autom. Reason. Matti Järvisalo, Armin Biere, Marijn Heule
2012	J	`jnl`	The International SAT Solver Competitions. AI Mag. Matti Järvisalo, Daniel Le Berre, Olivier Roussel, Laurent Simon
2012	J	`jnl`	Weak Models of Distributed Computing, with Connections to Modal Logic CoRR Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2012	A*	`conf`	Weak models of distributed computing, with connections to modal logic. PODC Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, Jonni Virtema
2011	A*	`conf`	Depth-Driven Circuit-Level Stochastic Local Search for SAT. IJCAI Anton Belov, Matti Järvisalo, Zbigniew Stachniak
2011	A	`conf`	Efficient CNF Simplification Based on Binary Implication Graphs. SAT Marijn Heule, Matti Järvisalo, Armin Biere
2011	B	`conf`	Itemset Mining as a Challenge Application for Answer Set Enumeration. LPNMR Matti Järvisalo
2011	A	`conf`	On the Relative Efficiency of DPLL and OBDDs with Axiom and Join. CP Matti Järvisalo
2011	J	`jnl`	Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability CoRR Anton Belov, Matti Järvisalo
2010	A	`conf`	Blocked Clause Elimination. TACAS Matti Järvisalo, Armin Biere, Marijn Heule
2010	—	`conf`	Clause Elimination Procedures for CNF Formulas. LPAR (Yogyakarta) Marijn Heule, Matti Järvisalo, Armin Biere
2010	J	`jnl`	Covered Clause Elimination CoRR Marijn Heule, Matti Järvisalo, Armin Biere
2010	—	`conf`	Covered Clause Elimination. LPAR short papers(Yogyakarta) Marijn Heule, Matti Järvisalo, Armin Biere
2010	A	`conf`	Reconstructing Solutions after Blocked Clause Elimination. SAT Matti Järvisalo, Armin Biere
2010	J	`jnl`	Testing and Debugging Techniques for Answer Set Solver Development CoRR Robert Brummayer, Matti Järvisalo
2010	J	`jnl`	Testing and debugging techniques for answer set solver development. Theory Pract. Log. Program. Robert Brummayer, Matti Järvisalo
2009	B	`conf`	A Module-Based Framework for Multi-language Constraint Modeling. LPNMR Matti Järvisalo, Emilia Oikarinen, Tomi Janhunen, Ilkka Niemelä
2009	J	`jnl`	Limitations of restricted branching in clause learning. Constraints An Int. J. Matti Järvisalo, Tommi A. Junttila
2009	B	`conf`	Max-ASP: Maximum Satisfiability of Answer Set Programs. LPNMR Emilia Oikarinen, Matti Järvisalo
2009	J	`jnl`	Structure-based satisfiability checkingAnalyzing and harnessing the potential. AI Commun. Matti Järvisalo
2008	J	`jnl`	Extended ASP Tableaux and rule redundancy in normal logic programs. Theory Pract. Log. Program. Matti Järvisalo, Emilia Oikarinen
2008	J	`jnl`	Extended ASP tableaux and rule redundancy in normal logic programs CoRR Matti Järvisalo, Emilia Oikarinen
2008	B	`conf`	Justification-Based Local Search with Adaptive Noise Strategies. LPAR Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
2008	A	`conf`	Justification-Based Non-Clausal Local Search for SAT. ECAI Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
2008	A*	`conf`	On the Power of Top-Down Branching Heuristics. AAAI Matti Järvisalo, Tommi A. Junttila
2008	—	`—`	Structure-based satisfiability checking : analyzing and harnessing the potential. Matti Järvisalo
2008	J	`jnl`	The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. J. Algorithms Matti Järvisalo, Ilkka Niemelä
2007	B	`conf`	Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs. ICLP Matti Järvisalo, Emilia Oikarinen
2007	A	`conf`	Limitations of Restricted Branching in Clause Learning. CP Matti Järvisalo, Tommi A. Junttila
2006	A*	`conf`	Further Investigations into Regular XORSAT. AAAI Matti Järvisalo
2006	J	`jnl`	Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. J. Satisf. Boolean Model. Comput. Harri Haanpää, Matti Järvisalo, Petteri Kaski, Ilkka Niemelä
2005	J	`jnl`	Unrestricted vs restricted cut in a tableau method for Boolean circuits. Ann. Math. Artif. Intell. Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä
2004	—	`conf`	Unrestricted vs Restricted Cut in a Tableau Method for Boolean Circuits. AI&M Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä