Pages that link to "Item:Q5756559"
From MaRDI portal
The following pages link to On Solving the Partial MAX-SAT Problem (Q5756559):
Displayed 37 items.
- Quantified maximum satisfiability (Q272016) (← links)
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- An abstract view on optimizations in SAT and ASP (Q2055811) (← links)
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
- \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems (Q2228416) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- On an MCS-based inconsistency measure (Q2374545) (← links)
- Formal methods for reasoning and uncertainty reduction in evidential grid maps (Q2407931) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Minimization of Visibly Pushdown Automata Using Partial Max-SAT (Q3303909) (← links)
- Exploiting Resolution-Based Representations for MaxSAT Solving (Q3453232) (← links)
- A New Approach to Partial MUS Enumeration (Q3453242) (← links)
- Modelling Max-CSP as Partial Max-SAT (Q3502687) (← links)
- A Preprocessor for Max-SAT Solvers (Q3502688) (← links)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (Q3502710) (← links)
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing (Q3637178) (← links)
- Generalizing Core-Guided Max-SAT (Q3637181) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- MiFuMax—a Literate MaxSAT Solver (Q5015595) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
- Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- SAT-based optimal classification trees for non-binary data (Q6049430) (← links)