Open-WBO
From MaRDI portal
swMATH10045MaRDI QIDQ22014FDOQ22014
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/978-3-319-09284-3_33
Cited In (66)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Efficient Learning of Interpretable Classification Rules
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Abstract cores in implicit hitting set MaxSat solving
- A proof builder for Max-SAT
- Propositional proof systems based on maximum satisfiability
- On weakening strategies for PB solvers
- Efficient local search for pseudo Boolean optimization
- Pakota: a system for enforcement in abstract argumentation
- Title not available (Why is that?)
- Resizing cardinality constraints for MaxSAT
- Integrating Passengers' Routes in Periodic Timetabling: A SAT approach.
- Riss
- New local search methods for partial MaxSAT
- Understanding cutting planes for QBFs
- Understanding the power of Max-SAT resolution through up-resilience
- IMLI
- Pueblo
- OPBDP
- RPOLY
- Sat4j
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Glucose
- PhyloWS
- QMaxSAT
- MiniMaxSat
- GlueMiniSat
- PackUp
- XHSTT
- Ltur
- PBLib
- LMHS
- WPM2
- MaxHS
- ESRA
- QBFEVAL
- BooleForce
- LeakWatch
- SCCWalk
- 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
- CCLS
- CCEHC
- SATLike
- RC2
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Maple_LCM_Dist_ChronoBT
- FourierSAT
- On tackling the limits of resolution in SAT solving
- Optimizing phylogenetic supertrees using answer set programming
- Exploiting resolution-based representations for MaxSAT solving
- Voting on multi-issue domains with conditionally lexicographic preferences
- WPM3
- LoRMIkA
- Open-WBO-Inc
- MLIC
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Proofs and Certificates for Max-SAT
- Open-WBO: a modular MaxSAT solver
- Reactive synthesis with maximum realizability of linear temporal logic specifications
- SAT-Based Horn Least Upper Bounds
- 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
- The \textsc{MergeSat} solver
This page was built for software: Open-WBO
