Community-Based Partitioning for MaxSAT Solving

DOI10.1007/978-3-642-39071-5_14zbMath1390.68603OpenAlexW192406999MaRDI QIDQ5326461

Ruben Martins, Inês Lynce, Vasco M. 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)

Related Items (5)

Using Community Structure to Detect Relevant Learnt Clauses ⋮ Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ Generating SAT instances with community structure ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver ⋮ Iterative and core-guided maxsat solving: a survey and assessment

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