1 citations · 1 across the 3 of their papers we have counts for
3 papers
Efficient and Reliable Hitting-Set Computations for the Implicit Hitting Set Approach
Hannes Ihalainen, Dieter Vandesande, André Schidler +3
The implicit hitting set (IHS) approach offers a general framework for solving computationally hard combinatorial optimization problems declaratively. IHS iterates between a decisi…
Certifying Pareto-Optimality in Multi-Objective Maximum Satisfiability
Christoph Jabs, Jeremias Berg, Bart Bogaerts +1
Due to the wide employment of automated reasoning in the analysis and construction of correct systems, the results reported by automated reasoning engines must be trustworthy. For…
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…