Pages that link to "Item:Q2348540"

The following pages link to Iterative and core-guided maxsat solving: a survey and assessment (Q2348540):

Displaying 32 items.

• Fast, flexible MUS enumeration (Q272009) (← links)
• Quantified maximum satisfiability (Q272016) (← links)
• MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
• New local search methods for partial MaxSAT (Q329035) (← links)
• On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
• Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
• WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
• Understanding the complexity of axiom pinpointing in lightweight description logics (Q1680678) (← links)
• Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
• Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
• Ranking with multiple reference points: efficient SAT-based learning procedures (Q2108155) (← links)
• Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
• A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
• A logic-based Benders decomposition for microscopic railway timetable planning (Q2158004) (← links)
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• Discrete Optimization with Decision Diagrams (Q2806864) (← links)
• Propositional SAT Solving (Q3176367) (← links)
• Advances in WASP (Q3449189) (← links)
• Exploiting Resolution-Based Representations for MaxSAT Solving (Q3453232) (← links)
• SAT-Based Formula Simplification (Q3453233) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• Model enumeration in propositional circumscription via unsatisfiable core analysis (Q4592705) (← links)
• Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem (Q4965126) (← links)
• Polarity and Variable Selection Heuristics for SAT-Based Anytime MaxSAT (Q5014283) (← links)
• On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
• MiFuMax—a Literate MaxSAT Solver (Q5015595) (← links)
• RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
• Proofs and Certificates for Max-SAT (Q5870516) (← links)