Hannes Ihalainen — accepted AI-conference papers

2026

Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach

Hannes Ihalainen, Dieter Vandesande, André Schidler, Jeremias Berg, Bart Bogaerts, Matti Järvisalo

AAAI 2026technical

The implicit hitting set (IHS) approach offers a general framework for solving computationally hard combinatorial optimization problems declaratively. IHS iterates between a decision oracle used for extracting sources of inconsistency and an optimizer for computing so-called hitting sets (HSs) over

Cited by 0 Source ↗PDF ↗Scholar ↗

2023

Unifying Core-Guided and Implicit Hitting Set Based Optimization

Hannes Ihalainen, Jeremias Berg, Matti Järvisalo

IJCAI 2023poster

Two of the most central algorithmic paradigms implemented in practical solvers for maximum satisfiability (MaxSAT) and other related declarative paradigms for NP-hard combinatorial optimization are the core-guided (CG) and implicit hitting set (IHS) approaches. We develop a general unifying algorith…

Cited by 1 Source ↗PDF ↗Scholar ↗