MiniMaxSat
From MaRDI portal
Software:21711
swMATH9732MaRDI QIDQ21711FDOQ21711
Author name not available (Why is that?)
Cited In (38)
- 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
- Boolean lexicographic optimization: algorithms \& applications
- Exploiting Cycle Structures in Max-SAT
- Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One
- Curriculum-based course timetabling with SAT and MaxSAT
- Extending linear relaxation for non-square matrices and soft constraints
- New local search methods for partial MaxSAT
- Probabilistic characterization of random Max \(r\)-Sat
- Understanding the power of Max-SAT resolution through up-resilience
- Propositional SAT Solving
- Iterative and core-guided maxsat solving: a survey and assessment
- Boosting branch-and-bound MaxSAT solvers with clause learning
- Semiring-Induced Propositional Logic: Definition and Basic Algorithms
- Planning as satisfiability with IPC simple preferences and action costs
- Improvements to Core-Guided Binary Search for MaxSAT
- Soft arc consistency revisited
- Incomplete inference for graph problems
- CHAMP: a multipass algorithm for Max Sat based on saver variables
- Pruning Search Space for Weighted First Order Horn Clause Satisfiability
- The first and second Max-SAT evaluations
- Russian doll search for the Steiner triple covering problem
- Exploiting the Power of mip Solvers in maxsat
- 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
- 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