The Community Structure of SAT Formulas

DOI10.1007/978-3-642-31612-8_31zbMath1273.68331OpenAlexW73352345MaRDI QIDQ2843344

Jordi Levy, Carlos Ansótegui, Jesús Giráldez-Cru

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: https://doi.org/10.1007/978-3-642-31612-8_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (14)

SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers ⋮ Using Community Structure to Detect Relevant Learnt Clauses ⋮ Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ Evaluating CDCL Variable Scoring Schemes ⋮ Generating SAT instances with community structure ⋮ The impact of heterogeneity and geometry on the proof complexity of random satisfiability ⋮ Towards better heuristics for solving bounded model checking problems ⋮ An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem ⋮ Popularity-similarity random SAT formulas ⋮ Unnamed Item ⋮ Learning Rate Based Branching Heuristic for SAT Solvers ⋮ On the Hardness of SAT with Community Structure ⋮ On the hierarchical community structure of practical Boolean formulas ⋮ A model of random industrial SAT

This page was built for publication: The Community Structure of SAT Formulas