Generating SAT instances with community structure
From MaRDI portal
Publication:309919
DOI10.1016/j.artint.2016.06.001zbMath1385.68041OpenAlexW2409909788MaRDI QIDQ309919
Jordi Levy, Jesús Giráldez-Cru
Publication date: 7 September 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2016.06.001
Related Items
Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden, Learning a propagation complete formula, Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth, Satisfiability threshold for power law random 2-SAT in configuration model, Popularity-similarity random SAT formulas, New models for generating hard random Boolean formulas and disjunctive logic programs, On the Hardness of SAT with Community Structure, Solving non-uniform planted and filtered random SAT formulas greedily, On the hierarchical community structure of practical Boolean formulas, A model of random industrial SAT
Uses Software
Cites Work
- Hyperbolic graph generator
- Finding Efficient Circuits for Ensemble Computation
- The Community Structure of SAT Formulas
- Emergence of Scaling in Random Networks
- Community Branching for Parallel Portfolio SAT Solvers
- Impact of Community Structure on SAT Solver Performance
- The Fractal Dimension of SAT Formulas
- 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
- Theory and Applications of Satisfiability Testing
- Community-Based Partitioning for MaxSAT Solving
- The complexity of theorem-proving procedures
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Unnamed Item
