Open-WBO: a modular MaxSAT solver
From MaRDI portal
Recommendations
Cited in
(46)- 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
- Efficient Learning of Interpretable Classification Rules
- Functional synthesis via input-output separation
- Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- A proof builder for Max-SAT
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Propositional proof systems based on maximum satisfiability
- Scheduling pre-operative assessment clinic with answer set programming
- Exact and approximate determination of the Pareto front using minimal correction subsets
- Efficient local search for pseudo Boolean optimization
- Pakota: a system for enforcement in abstract argumentation
- scientific article; zbMATH DE number 7306863 (Why is no real title available?)
- Resizing cardinality constraints for MaxSAT
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.
- New local search methods for partial MaxSAT
- Unsatisfiability-based algorithms for multi-objective combinatorial optimization
- Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
- Understanding cutting planes for QBFs
- Understanding the power of Max-SAT resolution through up-resilience
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- ASP-based approaches for solving the nuclear medicine scheduling problem
- Coupling different integer encodings for SAT
- Modeling and solving staff scheduling with partial weighted maxSAT
- A constraint optimization approach to causal discovery from subsampled time series data
- Enhancing MaxSAT local search via a unified soft clause weighting scheme
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Optimizing phylogenetic supertrees using answer set programming
- Exploiting resolution-based representations for MaxSAT solving
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- Voting on multi-issue domains with conditionally lexicographic preferences
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Solving weighted maximum satisfiability with branch and bound and clause learning
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Upper bound computation of information leakages for unbounded recursion
- Proofs and Certificates for Max-SAT
- Reactive synthesis with maximum realizability of linear temporal logic specifications
- Improving local search algorithm for pseudo Boolean optimization
- maxSAT-based large neighborhood search for high school timetabling
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- SAT-Based Horn Least Upper Bounds
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
- The \textsc{MergeSat} solver
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)
