Open-WBO: a modular MaxSAT solver
From MaRDI portal
Recommendations
Cited in
(47)- maxSAT-based large neighborhood search for high school timetabling
- A constraint optimization approach to causal discovery from subsampled time series data
- Modeling and solving staff scheduling with partial weighted maxSAT
- Understanding cutting planes for QBFs
- Understanding the power of Max-SAT resolution through up-resilience
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Efficient local search for pseudo Boolean optimization
- The \textsc{MergeSat} solver
- A proof builder for Max-SAT
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Coupling different integer encodings for SAT
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Propositional proof systems based on maximum satisfiability
- Reactive synthesis with maximum realizability of linear temporal logic specifications
- Voting on multi-issue domains with conditionally lexicographic preferences
- Pakota: a system for enforcement in abstract argumentation
- New local search methods for partial MaxSAT
- Exploiting resolution-based representations for MaxSAT solving
- SAT-Based Horn Least Upper Bounds
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Optimizing phylogenetic supertrees using answer set programming
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- Efficient Learning of Interpretable Classification Rules
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Resizing cardinality constraints for MaxSAT
- Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
- Integrating passengers' routes in periodic timetabling: a SAT approach
- Proofs and Certificates for Max-SAT
- Upper bound computation of information leakages for unbounded recursion
- Functional synthesis via input-output separation
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- ASP-based approaches for solving the nuclear medicine scheduling problem
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- Solving weighted maximum satisfiability with branch and bound and clause learning
- Improving local search algorithm for pseudo Boolean optimization
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
- Scheduling pre-operative assessment clinic with answer set programming
- Improving plan execution flexibility using block-substitution
This page was built for publication: Open-WBO: a modular MaxSAT solver
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192090)
