Showing cs.AIShow all
3 papers · 1 filter
cs.AI2025
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…
cs.AI2025
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…
cs.AI2024
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…