Dynamic polynomial watchdog encoding for solving weighted MaxSAT

DOI10.1007/978-3-319-94144-8_3MaRDI QIDQ1656559zbMATH OpenOpenAlexFDO

Authors Tobias Paxian, Sven Reimer, Bernd Becker

Publication date 10 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94144-8_3

Mathematics Subject Classification ID

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

Recommendations

• Solving the weighted MAX-SAT problem using the dynamic convexized method
• An efficient solver for weighted Max-SAT
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Minimaxsat: an efficient weighted Max-SAT solver
• Theory and Applications of Satisfiability Testing
• Solving weighted MAX-SAT via global equilibrium search
• On preprocessing for weighted MaxSAT

Cited in

(8)

• N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• Clause redundancy and preprocessing in maximum satisfiability
• On preprocessing for weighted MaxSAT
• Go-MOCE: greedy order method of conditional expectations for Max Sat
• \textsf{Open-WBO-Inc}: approximation strategies for incomplete weighted MaxSAT
• Certified Core-Guided MaxSAT Solving
• Certified MaxSAT preprocessing
• Multi-objective maximum satisfiability by single-objective implicit hitting set optimization

This page was built for publication: Dynamic polynomial watchdog encoding for solving weighted MaxSAT

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