36 citations · 103 across the 11 of their papers we have counts for
13 papers
Certified MaxSAT Preprocessing
Hannes Ihalainen, Andy Oertel, Yong Kiam Tan +3
Building on the progress in Boolean satisfiability (SAT) solving over the last decades, maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard optimizatio…
SharpSAT-TD in Model Counting Competitions 2021-2023
Tuukka Korhonen, Matti Järvisalo
We describe SharpSAT-TD, our submission to the unweighted and weighted tracks of the Model Counting Competition in 2021-2023, which has won in total first places in different t…
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation
Tuomo Lehtonen, Johannes P. Wallner, Matti Järvisalo
Assumption-based argumentation (ABA) is a central structured argumentation formalism. As shown recently, answer set programming (ASP) enables efficiently solving NP-hard reasoning…
A Journey into Ontology Approximation: From Non-Horn to Horn
Anneke Haga, Carsten Lutz, Johannes Marti +1
We study complete approximations of an ontology formulated in a non-Horn description logic (DL) such as in a Horn DL such as~. We provide concrete app…
Cautious reasoning in ASP via minimal models and unsatisfiable cores
Mario Alviano, Carmine Dodaro, Matti Järvisalo +2
Answer Set Programming (ASP) is a logic-based knowledge representation framework, supporting---among other reasoning modes---the central task of query answering. In the proposition…
Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity
James Cussens, Matti Järvisalo, Janne H. Korhonen +1
The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithm…
Causal Discovery from Subsampled Time Series Data by Constraint Optimization
Antti Hyttinen, Sergey Plis, Matti Järvisalo +2
This paper focuses on causal structure estimation from time series data in which measurements are obtained at a coarser timescale than the causal timescale of the underlying system…
Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure
Antti Hyttinen, Patrik O. Hoyer, Frederick Eberhardt +1
We present a very general approach to learning the structure of causal models based on d-separation constraints, obtained from any given set of overlapping passive observational or…
Separating OR, SUM, and XOR Circuits
Magnus Find, Mika Göös, Matti Järvisalo +3
Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x->Ax over different semirings. Namely, we study three circuit models: monotone OR-…
Synchronous Counting and Computational Algorithm Design
Danny Dolev, Keijo Heljanko, Matti Järvisalo +5
Consider a complete communication network on nodes, each of which is a state machine. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree o…
Weak Models of Distributed Computing, with Connections to Modal Logic
Lauri Hella, Matti Järvisalo, Antti Kuusisto +5
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker version…
Structure-Based Local Search Heuristics for Circuit-Level Boolean Satisfiability
Anton Belov, Matti Järvisalo
This work focuses on improving state-of-the-art in stochastic local search (SLS) for solving Boolean satisfiability (SAT) instances arising from real-world industrial SAT applicati…
Covered Clause Elimination
Marijn Heule, Matti Järvisalo, Armin Biere
Generalizing the novel clause elimination procedures developed in [M. Heule, M. Järvisalo, and A. Biere. Clause elimination procedures for CNF formulas. In Proc. LPAR-17, volume 63…