swMATH9732MaRDI QIDQ21711FDOQ21711
Author name not available (Why is that?)
Official website: http://link.springer.com/chapter/10.1007/978-3-540-72788-0_8
Cited In (76)
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Planning as satisfiability with IPC simple preferences and action costs
- Solving disjunctive temporal problems with preferences using maximum satisfiability
- Resolution-based lower bounds in MaxSAT
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Solving satisfiability problems with preferences
- A taxonomy of exact methods for partial Max-SAT
- MaxSAT by improved instance-specific algorithm configuration
- A framework for reasoning under uncertainty based on non-deterministic distance semantics
- Simplified forms of computerized reasoning with distance semantics
- Exploiting the power of MIP solvers in MAXSAT
- Boolean lexicographic optimization: algorithms \& applications
- Exploiting Cycle Structures in Max-SAT
- Curriculum-based course timetabling with SAT and MaxSAT
- Propositional SAT solving
- Semiring-induced propositional logic: definition and basic algorithms
- Extending linear relaxation for non-square matrices and soft constraints
- Improvements to core-guided binary search for MaxSAT
- Pruning search space for weighted first order Horn clause satisfiability
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- Understanding the power of Max-SAT resolution through up-resilience
- OptSAT
- Pueblo
- CP-nets
- MaxSolver
- UBCSAT
- MAX-2-SAT
- QingTing1
- Walksat
- PBS
- RPOLY
- PicoSAT
- Sat4j
- ToulBar2
- OPIUM
- Jerusat
- QMaxSAT
- MSUnCore
- Open-WBO
- SOCRATES
- linprog
- CCASat
- LMHS
- WPM2
- MaxHS
- mplp2
- Osprey
- PESPLib
- QUICKXPLAIN
- maxino
- HapCUT
- Iterative and core-guided maxsat solving: a survey and assessment
- CCLS
- CCEHC
- SATLike
- RC2
- HiRise
- GenericWrapper4AC
- Soft arc consistency revisited
- Incomplete inference for graph problems
- WPM3
- Open-WBO-Inc
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- The first and second Max-SAT evaluations
- Russian doll search for the Steiner triple covering problem
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Algorithms for Weighted Boolean Optimization
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Computational protein design as an optimization problem
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Reducing chaos in SAT-like search: finding solutions close to a given one
- Using the method of conditional expectations to supply an improved starting point for CCLS
- Inductive theorem proving based on tree grammars
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Exploiting subproblem optimization in SAT-based maxsat algorithms
This page was built for software: MiniMaxSat
