Community-Based Partitioning for MaxSAT Solving

DOI10.1007/978-3-642-39071-5_14MaRDI QIDQ5326461zbMATH OpenOpenAlexFDO

Authors Ruben Martins, Inês Lynce, Vasco Manquinho

Publication date 5 August 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-39071-5_14

Mathematics Subject Classification ID

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

Recommendations

• Community structure inspired algorithms for SAT and \#SAT
• The maximum community partition problem in networks
• Analysis and solving SAT and MAX-SAT problems using an L-partition approach
• On the hardness of SAT with community structure
• Community branching for parallel portfolio SAT solvers
• On Solving the Partial MAX-SAT Problem
• A taxonomy of exact methods for partial Max-SAT
• Impact of Community Structure on SAT Solver Performance

Cited in

(7)

• Impact of Community Structure on SAT Solver Performance
• Using Community Structure to Detect Relevant Learnt Clauses
• Generating SAT instances with community structure
• Iterative and core-guided maxsat solving: a survey and assessment
• Exploiting resolution-based representations for MaxSAT solving
• Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
• \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver

This page was built for publication: Community-Based Partitioning for MaxSAT Solving

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