QMaxSAT: A partial Max-SAT solver

MaRDI QIDQ2786911zbMATH OpenFDO

Authors Miyuki Koshimura, Tong Zhang, Hiroshi Fujita, Ryuzo Hasegawa

Publication date 23 February 2016

Published in Journal of Satisfiability, Boolean Modeling and Computation (Search for Journal in Brave)

zbMATH Keywords

Boolean cardinality constraintsCDCL solverpartial Max-SAT solver

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Incremental Encoding and Solving of Cardinality Constraints
• Minimaxsat: an efficient weighted Max-SAT solver
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Sequential Encodings from Max-CSP into Partial Max-SAT
• On Solving the Partial MAX-SAT Problem

Cited in

(31)

• A constraint optimization approach to causal discovery from subsampled time series data
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• Using the method of conditional expectations to supply an improved starting point for CCLS
• A novel algorithm for Max Sat calling MOCE to order
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
• On preprocessing for weighted MaxSAT
• Improved WPM encoding for coalition structure generation under MC-nets
• Iterative and core-guided maxsat solving: a survey and assessment
• CHAMP: a multipass algorithm for Max Sat based on saver variables
• Go-MOCE: greedy order method of conditional expectations for Max Sat
• QMaxSATpb: a certified MaxSAT solver
• MaxSAT by improved instance-specific algorithm configuration
• Query-guided maximum satisfiability
• New local search methods for partial MaxSAT
• Exploiting resolution-based representations for MaxSAT solving
• Sequential Encodings from Max-CSP into Partial Max-SAT
• On using incremental encodings in unsatisfiability-based MaxSAT solving
• \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
• RC2: an efficient MaxSAT solver
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
• Boosting branch-and-bound MaxSAT solvers with clause learning
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Resizing cardinality constraints for MaxSAT
• Exploiting subproblem optimization in SAT-based maxsat algorithms
• On Solving the Partial MAX-SAT Problem
• Certified dominance and symmetry breaking for combinatorial optimisation
• Quantum circuit mapping based on incremental and parallel SAT solving
• Enhancing MaxSAT local search via a unified soft clause weighting scheme
• Solving weighted maximum satisfiability with branch and bound and clause learning
• Automatic algorithm selection for pseudo-Boolean optimization with given computational time limits

Describes a project that uses

Uses Software

• QMaxSAT

This page was built for publication: QMaxSAT: A partial Max-SAT solver

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786911)