Using Community Structure to Detect Relevant Learnt Clauses

DOI10.1007/978-3-319-24318-4_18zbMath1471.68235OpenAlexW2098993696MaRDI QIDQ3453229

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

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_18

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (3)

Generating SAT instances with community structure ⋮ Decomposing SAT Instances with Pseudo Backbones ⋮ Popularity-similarity random SAT formulas

Uses Software

• MiniSat
• Chaff
• Lingeling

Cites Work

• The Community Structure of SAT Formulas
• Inprocessing Rules
• Empirical Study of the Anatomy of Modern Sat Solvers
• Impact of Community Structure on SAT Solver Performance
• Community structure in social and biological networks
• Theory and Applications of Satisfiability Testing
• Community-Based Partitioning for MaxSAT Solving
• A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers

This page was built for publication: Using Community Structure to Detect Relevant Learnt Clauses