Improvements to core-guided binary search for MaxSAT

DOI10.1007/978-3-642-31612-8_22MaRDI QIDQ2843334zbMATH OpenOpenAlexFDO

Authors Antonio Morgado, Federico Heras, Joao Marques-Silva

Publication date 12 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10344/2771

Mathematics Subject Classification ID

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

Recommendations

• Iterative and core-guided maxsat solving: a survey and assessment
• Progression in maximum satisfiability
• Generalizing Core-Guided Max-SAT
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Cores in core based MaxSat algorithms: an analysis

Cited in

(16)

• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• N-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• Unifying reasoning and core-guided search for maximum satisfiability
• Core-boosted linear search for incomplete MaxSAT
• Iterative and core-guided maxsat solving: a survey and assessment
• Quantified maximum satisfiability
• Cores in core based MaxSat algorithms: an analysis
• Advances in WASP
• Exploiting resolution-based representations for MaxSAT solving
• Generalizing Core-Guided Max-SAT
• On using incremental encodings in unsatisfiability-based MaxSAT solving
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Exploiting subproblem optimization in SAT-based maxsat algorithms
• Progression in maximum satisfiability
• Quantified maximum satisfiability: a core-guided approach
• Certified MaxSAT preprocessing

Describes a project that uses

Uses Software

• MiniMaxSat
• Reveal
• MSUnCore
• QMaxSAT

This page was built for publication: Improvements to core-guided binary search for MaxSAT

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