Maximum satisfiabiliy
Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …
an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function …
Abstract cores in implicit hitting set MaxSat solving
Abstract Maximum Satisfiability (MaxSat) solving is an active area of research motivated by
numerous successful applications to solving NP-hard combinatorial optimization problems …
numerous successful applications to solving NP-hard combinatorial optimization problems …
MaxSAT Evaluation 2018: New developments and detailed results
F Bacchus, M Järvisalo… - Journal on Satisfiability …, 2019 - content.iospress.com
Abstract The series of MaxSAT Evaluations, organized yearly since 2006, has been the main
forum for evaluating the state of the art in solvers for the Boolean optimization paradigm of …
forum for evaluating the state of the art in solvers for the Boolean optimization paradigm of …
Reduced cost fixing in MaxSAT
We investigate utilizing the integer programming (IP) technique of reduced cost fixing to
improve maximum satisfiability (MaxSAT) solving. In particular, we show how reduced cost …
improve maximum satisfiability (MaxSAT) solving. In particular, we show how reduced cost …
[PDF][PDF] Pseudo-boolean optimization by implicit hitting sets
P Smirnov, J Berg, M Järvisalo - … on Principles and …, 2021 - researchportal.helsinki.fi
Recent developments in applying and extending Boolean satisfiability (SAT) based
techniques have resulted in new types of approaches to pseudo-Boolean optimization …
techniques have resulted in new types of approaches to pseudo-Boolean optimization …
[PDF][PDF] MaxHS in the 2020 MaxSAT evaluation
F Bacchus - MaxSAT Evaluation, 2020 - maxsat-evaluations.github.io
MaxHS is a MaxSat solver originally developed in [6]. It was the first MaxSat solver to utilize
the Implicit Hitting Set (IHS) approach, and its core components are described in [6],[4],[5],[7] …
the Implicit Hitting Set (IHS) approach, and its core components are described in [6],[4],[5],[7] …
[PDF][PDF] Enabling incrementality in the implicit hitting set approach to MaxSAT under changing weights
Recent advances in solvers for the Boolean satisfiability (SAT) based optimization paradigm
of maximum satisfiability (MaxSAT) have turned MaxSAT into a viable approach to finding …
of maximum satisfiability (MaxSAT) have turned MaxSAT into a viable approach to finding …
[PDF][PDF] A hybrid approach to optimization in answer set programming
Answer set programming (ASP) is today a successful approach to knowledge representation
and reasoning in various real-world problem domains. ASP offers an expressive rule-based …
and reasoning in various real-world problem domains. ASP offers an expressive rule-based …
[PDF][PDF] Reduced Cost Fixing for Maximum Satisfiability.
Maximum satisfiability (MaxSAT) offers a competitive approach to solving NP-hard real-
world optimization problems. While state-of-the-art MaxSAT solvers rely heavily on Boolean …
world optimization problems. While state-of-the-art MaxSAT solvers rely heavily on Boolean …
[PDF][PDF] Implicit Hitting Set Algorithms for Constraint Optimization.
P Saikko - 2019 - paulsaikko.com
Computationally hard optimization problems are commonplace not only in theory but also in
practice in many real-world domains. Even determining whether a solution exists can be NP …
practice in many real-world domains. Even determining whether a solution exists can be NP …