Unrestricted vs restricted cut in a tableau method for Boolean circuits. - Matti Järvisalo; Tommi A. Junttila; Ilkka Niemelä (Ann. Math. Artif. Intell., 2005)

Further Investigations into Regular XORSAT. - Matti Järvisalo (AAAI, 2006)

Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques. - Harri Haanpää; Matti Järvisalo; Petteri Kaski; Ilkka Niemelä (J. Satisf. Boolean Model. Comput., 2006)

On the Power of Top-Down Branching Heuristics. - Matti Järvisalo; Tommi A. Junttila (AAAI, 2008)

Justification-Based Non-Clausal Local Search for SAT. - Matti Järvisalo; Tommi A. Junttila; Ilkka Niemelä (ECAI, 2008)

Justification-Based Local Search with Adaptive Noise Strategies. - Matti Järvisalo; Tommi A. Junttila; Ilkka Niemelä (LPAR, 2008)

The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. - Matti Järvisalo; Ilkka Niemelä (J. Algorithms, 2008)

Extended ASP Tableaux and rule redundancy in normal logic programs. - Matti Järvisalo; Emilia Oikarinen (Theory Pract. Log. Program., 2008)

Structure-based satisfiability checking : analyzing and harnessing the potential. - Matti Järvisalo (2008)

A Module-Based Framework for Multi-language Constraint Modeling. - Matti Järvisalo; Emilia Oikarinen; Tomi Janhunen; Ilkka Niemelä (LPNMR, 2009)

Max-ASP: Maximum Satisfiability of Answer Set Programs. - Emilia Oikarinen; Matti Järvisalo (LPNMR, 2009)

Structure-based satisfiability checkingAnalyzing and harnessing the potential. - Matti Järvisalo (AI Commun., 2009)

Limitations of restricted branching in clause learning. - Matti Järvisalo; Tommi A. Junttila (Constraints An Int. J., 2009)

Clause Elimination Procedures for CNF Formulas. - Marijn Heule; Matti Järvisalo; Armin Biere (LPAR (Yogyakarta), 2010)

Covered Clause Elimination. - Marijn Heule; Matti Järvisalo; Armin Biere (LPAR short papers(Yogyakarta), 2010)

Reconstructing Solutions after Blocked Clause Elimination. - Matti Järvisalo; Armin Biere (SAT, 2010)

Blocked Clause Elimination. - Matti Järvisalo; Armin Biere; Marijn Heule (TACAS, 2010)

Testing and debugging techniques for answer set solver development. - Robert Brummayer; Matti Järvisalo (Theory Pract. Log. Program., 2010)

On the Relative Efficiency of DPLL and OBDDs with Axiom and Join. - Matti Järvisalo (CP, 2011)

Depth-Driven Circuit-Level Stochastic Local Search for SAT. - Anton Belov; Matti Järvisalo; Zbigniew Stachniak (IJCAI, 2011)

Itemset Mining as a Challenge Application for Answer Set Enumeration. - Matti Järvisalo (LPNMR, 2011)

Efficient CNF Simplification Based on Binary Implication Graphs. - Marijn Heule; Matti Järvisalo; Armin Biere (SAT, 2011)

Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability - Anton Belov; Matti Järvisalo (CoRR, 2011)

Inprocessing Rules. - Matti Järvisalo; Marijn Heule; Armin Biere (IJCAR, 2012)

Relating Proof Complexity Measures and Practical Hardness of SAT. - Matti Järvisalo; Arie Matsliah; Jakob Nordström; Stanislav Zivný (CP, 2012)

Finding Efficient Circuits for Ensemble Computation. - Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (SAT, 2012)

The International SAT Solver Competitions. - Matti Järvisalo; Daniel Le Berre; Olivier Roussel; Laurent Simon 001 (AI Mag., 2012)

Simulating Circuit-Level Simplifications on CNF. - Matti Järvisalo; Armin Biere; Marijn Heule (J. Autom. Reason., 2012)

Revisiting Hyper Binary Resolution. - Marijn Heule; Matti Järvisalo; Armin Biere (CPAIOR, 2013)

Harnessing Constraint Programming for Poetry Composition. - Jukka M. Toivanen; Matti Järvisalo; Hannu Toivonen (ICCC, 2013)

Optimal Correlation Clustering via MaxSAT. - Jeremias Berg; Matti Järvisalo (ICDM Workshops, 2013)

Formula Preprocessing in MUS Extraction. - Anton Belov; Matti Järvisalo; João Marques-Silva 001 (TACAS, 2013)

Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure. - Antti Hyttinen; Patrik O. Hoyer; Frederick Eberhardt; Matti Järvisalo (UAI, 2013)

Optimal Neighborhood Preserving Visualization by Maximum Satisfiability. - Kerstin Bunte; Matti Järvisalo; Jeremias Berg; Petri Myllymäki; Jaakko Peltonen; Samuel Kaski (AAAI, 2014)

Predicting the Hardness of Learning Bayesian Networks. - Brandon M. Malone; Kustaa Kangas; Matti Järvisalo; Mikko Koivisto; Petri Myllymäki (AAAI, 2014)

Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability. - Jeremias Berg; Matti Järvisalo; Brandon M. Malone (AISTATS, 2014)

SAT-Based Approaches to Treewidth Computation: An Evaluation. - Jeremias Berg; Matti Järvisalo (ICTAI, 2014)

Answer Set Solver Backdoors. - Emilia Oikarinen; Matti Järvisalo (JELIA, 2014)

Conditional Lower Bounds for Failed Literals and Related Techniques. - Matti Järvisalo; Janne H. Korhonen (SAT, 2014)

Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming. - Antti Hyttinen; Frederick Eberhardt; Matti Järvisalo (UAI, 2014)

Complexity-sensitive decision procedures for abstract argumentation. - Wolfgang Dvorák; Matti Järvisalo; Johannes Peter Wallner; Stefan Woltran (Artif. Intell., 2014)

MaxSAT-Based Cutting Planes for Learning Graphical Models. - Paul Saikko; Brandon M. Malone; Matti Järvisalo (CPAIOR, 2015)

Re-using Auxiliary Variables for MaxSAT Preprocessing. - Jeremias Berg; Paul Saikko; Matti Järvisalo (ICTAI, 2015)

Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT. - Jeremias Berg; Paul Saikko; Matti Järvisalo (IJCAI, 2015)

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). - Wolfgang Dvorák; Matti Järvisalo; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2015)

Do-calculus when the True Graph Is Unknown. - Antti Hyttinen; Frederick Eberhardt; Matti Järvisalo (UAI, 2015)

Impact of Learning Strategies on the Quality of Bayesian Networks: An Empirical Evaluation. - Brandon M. Malone; Matti Järvisalo; Petri Myllymäki (UAI, 2015)

Learning Optimal Chain Graphs with Answer Set Programming. - Dag Sonntag; Matti Järvisalo; José M. Peña 001; Antti Hyttinen (UAI, 2015)

Overview and analysis of the SAT Challenge 2012 solver competition. - Adrian Balint; Anton Belov; Matti Järvisalo; Carsten Sinz (Artif. Intell., 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; Jonni Virtema (Distributed Comput., 2015)

Clause Elimination for SAT and QSAT. - Marijn Heule; Matti Järvisalo; Florian Lonsing; Martina Seidl; Armin Biere (J. Artif. Intell. Res., 2015)

Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving. - Jeremias Berg; Matti Järvisalo (CP, 2016)

Subsumed Label Elimination for Maximum Satisfiability. - Jeremias Berg; Paul Saikko; Matti Järvisalo (ECAI, 2016)

Boolean Satifiability and Beyond: Algorithms, Analysis, and AI Applications. - Matti Järvisalo (IJCAI, 2016)

Optimal Status Enforcement in Abstract Argumentation. - Andreas Niskanen; Johannes Peter Wallner; Matti Järvisalo (IJCAI, 2016)

Pakota: A System for Enforcement in Abstract Argumentation. - Andreas Niskanen; Johannes Peter Wallner; Matti Järvisalo (JELIA, 2016)

Implicit Hitting Set Algorithms for Reasoning Beyond NP. - Paul Saikko; Johannes Peter Wallner; Matti Järvisalo (KR, 2016)

Causal Discovery from Subsampled Time Series Data by Constraint Optimization. - Antti Hyttinen; Sergey M. Plis; Matti Järvisalo; Frederick Eberhardt; David Danks (Probabilistic Graphical Models, 2016)

LMHS: A SAT-IP Hybrid MaxSAT Solver. - Paul Saikko; Jeremias Berg; Matti Järvisalo (SAT, 2016)

Synchronous counting and computational algorithm design. - Danny Dolev; Keijo Heljanko; Matti Järvisalo; Janne H. Korhonen; Christoph Lenzen 001; Joel Rybicki; Jukka Suomela; Siert Wieringa (J. Comput. Syst. Sci., 2016)

Separating OR, SUM, and XOR circuits. - Magnus Find; Mika Göös; Matti Järvisalo; Petteri Kaski; Mikko Koivisto; Janne H. Korhonen (J. Comput. Syst. Sci., 2016)

SAT Competition 2016: Recent Developments. - Tomás Balyo; Marijn J. H. Heule; Matti Järvisalo (AAAI, 2017)

Reduced Cost Fixing in MaxSAT. - Fahiem Bacchus; Antti Hyttinen; Matti Järvisalo; Paul Saikko (CP, 2017)

Weight-Aware Core Extraction in SAT-Based MaxSAT Solving. - Jeremias Berg; Matti Järvisalo (CP, 2017)

Minimum-Width Confidence Bands via Constraint Optimization. - Jeremias Berg; Emilia Oikarinen; Matti Järvisalo; Kai Puolamäki (CP, 2017)

From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (ECSQARU, 2017)

On Computing Generalized Backbones. - Alessandro Previti; Alexey Ignatiev; Matti Järvisalo; João Marques-Silva 001 (ICTAI, 2017)

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity (Extended Abstract). - James Cussens; Matti Järvisalo; Janne H. Korhonen; Mark Bartlett (IJCAI, 2017)

A Core-Guided Approach to Learning Optimal Causal Graphs. - Antti Hyttinen; Paul Saikko; Matti Järvisalo (IJCAI, 2017)

Learning Chordal Markov Networks via Branch and Bound. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (NIPS, 2017)

AS-ASL: Algorithm Selection with Auto-sklearn. - Brandon M. Malone; Kustaa Kangas; Matti Järvisalo; Mikko Koivisto; Petri Myllymäki (OASC, 2017)

MaxPre: An Extended MaxSAT Preprocessor. - Tuukka Korhonen; Jeremias Berg; Paul Saikko; Matti Järvisalo (SAT, 2017)

Improving MCS Enumeration via Caching. - Alessandro Previti; Carlos Mencía; Matti Järvisalo; João Marques-Silva 001 (SAT, 2017)

Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability. - Jeremias Berg; Matti Järvisalo (Artif. Intell., 2017)

A constraint optimization approach to causal discovery from subsampled time series data. - Antti Hyttinen; Sergey M. Plis; Matti Järvisalo; Frederick Eberhardt; David Danks (Int. J. Approx. Reason., 2017)

Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity. - James Cussens; Matti Järvisalo; Janne H. Korhonen; Mark Bartlett (J. Artif. Intell. Res., 2017)

Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation. - Johannes Peter Wallner; Andreas Niskanen; Matti Järvisalo (J. Artif. Intell. Res., 2017)

Premise Set Caching for Enumerating Minimal Correction Subsets. - Alessandro Previti; Carlos Mencía; Matti Järvisalo; João Marques-Silva 001 (AAAI, 2018)

SAT for Argumentation. - Matti Järvisalo (SAFA@COMMA, 2018)

SAT-Based Approaches to Adjusting, Repairing, and Computing Largest Extensions of Argumentation Frameworks. - Tuomo Lehtonen; Andreas Niskanen; Matti Järvisalo (COMMA, 2018)

Reduced Cost Fixing for Maximum Satisfiability. - Fahiem Bacchus; Antti Hyttinen; Matti Järvisalo; Paul Saikko (IJCAI, 2018)

Extension Enforcement under Grounded Semantics in Abstract Argumentation. - Andreas Niskanen; Johannes Peter Wallner; Matti Järvisalo (KR, 2018)

A Hybrid Approach to Optimization in Answer Set Programming. - Paul Saikko; Carmine Dodaro; Mario Alviano; Matti Järvisalo (KR, 2018)

Learning Optimal Causal Graphs with Exact Search. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (PGM, 2018)

A preference-based approach to backbone computation with application to argumentation. - Alessandro Previti; Matti Järvisalo (SAC, 2018)

Applications of MaxSAT in Data Analysis. - Jeremias Berg; Antti Hyttinen; Matti Järvisalo (POS@SAT, 2018)

Empirical hardness of finding optimal Bayesian network structures: algorithm selection and runtime prediction. - Brandon M. Malone; Kustaa Kangas; Matti Järvisalo; Mikko Koivisto; Petri Myllymäki (Mach. Learn., 2018)

Cautious reasoning in ASP via minimal models and unsatisfiable cores. - Mario Alviano; Carmine Dodaro; Matti Järvisalo; Marco Maratea; Alessandro Previti (Theory Pract. Log. Program., 2018)

Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (AAAI, 2019)

Centrality Heuristics for Exact Model Counting. - Bernhard Bliem; Matti Järvisalo (ICTAI, 2019)

Enumerating Potential Maximal Cliques via SAT and ASP. - Tuukka Korhonen; Jeremias Berg; Matti Järvisalo (IJCAI, 2019)

Unifying Reasoning and Core-Guided Search for Maximum Satisfiability. - Jeremias Berg; Matti Järvisalo (JELIA, 2019)

Preprocessing Argumentation Frameworks via Replacement Patterns. - Wolfgang Dvorák; Matti Järvisalo; Thomas Linsbichler; Andreas Niskanen; Stefan Woltran (JELIA, 2019)

Towards transformational creation of novel songs. - Jukka M. Toivanen; Matti Järvisalo; Olli Alm; Dan Ventura; Martti Vainio; Hannu Toivonen (Connect. Sci., 2019)

Synthesizing Argumentation Frameworks from Examples. - Andreas Niskanen; Johannes Peter Wallner; Matti Järvisalo (J. Artif. Intell. Res., 2019)

Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. - Tuukka Korhonen; Jeremias Berg; Matti Järvisalo (ACM J. Exp. Algorithmics, 2019)

MaxSAT Evaluation 2018: New Developments and Detailed Results. - Fahiem Bacchus; Matti Järvisalo; Ruben Martins (J. Satisf. Boolean Model. Comput., 2019)

SAT Competition 2018. - Marijn J. H. Heule; Matti Järvisalo; Martin Suda 001 (J. Satisf. Boolean Model. Comput., 2019)

Finding Most Compatible Phylogenetic Trees over Multi-State Characters. - Tuukka Korhonen; Matti Järvisalo (AAAI, 2020)

Deciding Acceptance in Incomplete Argumentation Frameworks. - Andreas Niskanen; Daniel Neugebauer; Matti Järvisalo; Jörg Rothe (AAAI, 2020)

Preprocessing in Incomplete MaxSAT Solving. - Marcus Leivo; Jeremias Berg; Matti Järvisalo (ECAI, 2020)

Strong Refinements for Hard Problems in Argumentation Dynamics. - Andreas Niskanen; Matti Järvisalo (ECAI, 2020)

Algorithms for Dynamic Argumentation Frameworks: An Incremental SAT-Based Approach. - Andreas Niskanen; Matti Järvisalo (ECAI, 2020)

Learning Chordal Markov Networks via Stochastic Local Search. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (ECAI, 2020)

Controllability of Control Argumentation Frameworks. - Andreas Niskanen; Daniel Neugebauer; Matti Järvisalo (IJCAI, 2020)

An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (KR, 2020)

Smallest Explanations and Diagnoses of Rejection in Abstract Argumentation. - Andreas Niskanen; Matti Järvisalo (KR, 2020)

µ-toksia: An Efficient Abstract Argumentation Reasoner. - Andreas Niskanen; Matti Järvisalo (KR, 2020)

Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation. - Jarkko Savela; Emilia Oikarinen; Matti Järvisalo (LPAR, 2020)

Learning Optimal Cyclic Causal Graphs from Interventional Data. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (PGM, 2020)

Discovering causal graphs with cycles and latent confounders: An exact branch-and-bound approach. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (Int. J. Approx. Reason., 2020)

Refined Core Relaxation for Core-Guided MaxSAT Solving. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo (CP, 2021)

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). - Tuukka Korhonen; Matti Järvisalo (CP, 2021)

Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. - Andreas Niskanen; Jeremias Berg; Matti Järvisalo (CP, 2021)

Pseudo-Boolean Optimization by Implicit Hitting Sets. - Pavel Smirnov 003; Jeremias Berg; Matti Järvisalo (CP, 2021)

Maximal ancestral graph structure learning via exact search. - Kari Rantanen; Antti Hyttinen; Matti Järvisalo (UAI, 2021)

Acceptance in incomplete argumentation frameworks. - Dorothea Baumeister; Matti Järvisalo; Daniel Neugebauer; Andreas Niskanen; Jörg Rothe (Artif. Intell., 2021)

SAT Competition 2020. - Nils Froleyks; Marijn Heule; Markus Iser; Matti Järvisalo; Martin Suda 001 (Artif. Intell., 2021)

Declarative Algorithms and Complexity Results for Assumption-Based Argumentation. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (J. Artif. Intell. Res., 2021)

Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (Theory Pract. Log. Program., 2021)

Maximum Satisfiability. - Fahiem Bacchus; Matti Järvisalo; Ruben Martins (Handbook of Satisfiability, 2021)

Preprocessing in SAT Solving. - Armin Biere; Matti Järvisalo; Benjamin Kiesl (Handbook of Satisfiability, 2021)

Clause Redundancy and Preprocessing in Maximum Satisfiability. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo (IJCAR, 2022)

Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (COMMA, 2022)

Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism. - Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (KR, 2022)

Computing Smallest MUSes of Quantified Boolean Formulas. - Andreas Niskanen; Jere Mustonen; Jeremias Berg; Matti Järvisalo (LPNMR, 2022)

Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. - Pavel Smirnov 003; Jeremias Berg; Matti Järvisalo (SAT, 2022)

MaxSAT-Based Bi-Objective Boolean Optimization. - Christoph Jabs; Jeremias Berg; Andreas Niskanen; Matti Järvisalo (SAT, 2022)

Incremental Maximum Satisfiability. - Andreas Niskanen; Jeremias Berg; Matti Järvisalo (SAT, 2022)

SAT-based Judgment Aggregation. - Ari Conati; Andreas Niskanen; Matti Järvisalo (AAMAS, 2023)

Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. - Christoph Jabs; Jeremias Berg; Hannes Ihalainen; Matti Järvisalo (CP, 2023)

Oracle-Based Local Search for Pseudo-Boolean Optimization. - Markus Iser; Jeremias Berg; Matti Järvisalo (ECAI, 2023)

MaxSAT-Based Inconsistency Measurement. - Andreas Niskanen; Isabelle Kuhlmann; Matthias Thimm; Matti Järvisalo (ECAI, 2023)

Unifying Core-Guided and Implicit Hitting Set Based Optimization. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo (IJCAI, 2023)

Computing MUS-Based Inconsistency Measures. - Isabelle Kuhlmann; Andreas Niskanen; Matti Järvisalo (JELIA, 2023)

Design of ICCMA 2023, 5th International Competition on Computational Models of Argumentation: A Preliminary Report (invited paper). - Matti Järvisalo; Tuomo Lehtonen; Andreas Niskanen (Arg&App@KR, 2023)

Argumentative Reasoning in ASPIC+ under Incomplete Information. - Daphne Odekerken; Tuomo Lehtonen; AnneMarie Borg; Johannes Peter Wallner; Matti Järvisalo (KR, 2023)

SharpSAT-TD in Model Counting Competitions 2021-2023. - Tuukka Korhonen; Matti Järvisalo (CoRR, 2023)

Learning MDL Logic Programs from Noisy Data. - Céline Hocquette; Andreas Niskanen; Matti Järvisalo; Andrew Cropper (AAAI, 2024)

Core Boosting in SAT-Based Multi-objective Optimization. - Christoph Jabs; Jeremias Berg; Matti Järvisalo (CPAIOR (2), 2024)

Complexity Results and Algorithms for Manipulation and Bribery in Judgment Aggregation. - Ari Conati; Andreas Niskanen; Ronald de Haan; Matti Järvisalo (ECAI, 2024)

SAT-Based Approaches to Reasoning in Choice Logics. - Tuomo Lehtonen; Andreas Niskanen; Matti Järvisalo (ECAI, 2024)

Learning Big Logical Rules by Joining Small Rules. - Céline Hocquette; Andreas Niskanen; Rolf Morel; Matti Järvisalo; Andrew Cropper (IJCAI, 2024)

Certified MaxSAT Preprocessing. - Hannes Ihalainen; Andy Oertel; Yong Kiam Tan; Jeremias Berg; Matti Järvisalo; Magnus O. Myreen; Jakob Nordström (IJCAR (1), 2024)

Complexity Results and Algorithms for Preferential Argumentative Reasoning in ASPIC+. - Tuomo Lehtonen; Daphne Odekerken; Johannes Peter Wallner; Matti Järvisalo (KR, 2024)

Certified MaxSAT Preprocessing. - Hannes Ihalainen; Andy Oertel; Yong Kiam Tan; Jeremias Berg; Matti Järvisalo; Jakob Nordström (CoRR, 2024)

Declarative Approaches to Outcome Determination in Judgment Aggregation. - Ari Conati; Andreas Niskanen; Matti Järvisalo (J. Artif. Intell. Res., 2024)

Unifying SAT-Based Approaches to Maximum Satisfiability Solving. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo (J. Artif. Intell. Res., 2024)

From Single-Objective to Bi-Objective Maximum Satisfiability Solving. - Christoph Jabs; Jeremias Berg; Andreas Niskanen; Matti Järvisalo (J. Artif. Intell. Res., 2024)

Symmetric Core Learning for Pseudo-Boolean Optimization by Implicit Hitting Sets. - Hannes Ihalainen; Jeremias Berg; Matti Järvisalo; Bart Bogaerts 001 (CP, 2025)

Computing Efficient and Envy-Free Allocations under Dichotomous Preferences using SAT. - Ari Conati; Andreas Niskanen; Ronald de Haan; Matti Järvisalo (AAMAS, 2025)

Engineering and Evaluating Multi-objective Pseudo-Boolean Optimizers. - Christoph Jabs; Jeremias Berg; Matti Järvisalo (JELIA (1), 2025)

Certifying Pareto-Optimality in Multi Objective Maximum Satisfiability. - Christoph Jabs; Jeremias Berg; Bart Bogaerts 001; Matti Järvisalo (TACAS (2), 2025)

ICCMA 2023: 5th International Competition on Computational Models of Argumentation. - Matti Järvisalo; Tuomo Lehtonen; Andreas Niskanen (Artif. Intell., 2025)

Argumentative Reasoning in ASPIC+ under Incomplete Information. - Daphne Odekerken; Tuomo Lehtonen; Johannes Peter Wallner; Matti Järvisalo (J. Artif. Intell. Res., 2025)

Symmetry breaking for inductive logic programming. - Andrew Cropper; David M. Cerna; Matti Järvisalo (CoRR, 2025)

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach. - Hannes Ihalainen; Dieter Vandesande; André Schidler; Jeremias Berg; Bart Bogaerts 001; Matti Järvisalo (CoRR, 2025)