Generating SAT instances with community structure
From MaRDI portal
Publication:309919
DOI10.1016/J.ARTINT.2016.06.001zbMATH Open1385.68041OpenAlexW2409909788MaRDI QIDQ309919FDOQ309919
Authors: Jesús Giráldez-Cru, Jordi Levy 
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
Recommendations
- Community structure inspired algorithms for SAT and \#SAT
- The community structure of SAT formulas
- Impact of Community Structure on SAT Solver Performance
- Community structure in industrial SAT instances
- On the hardness of SAT with community structure
- SAT-based models for overlapping community detection in networks
- On the community structure of bounded model checking SAT problems
- Generating Diverse Solutions in SAT
Cites Work
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- \textsf{SATGraf}: visualizing the evolution of SAT formula structure in solvers
- Emergence of Scaling in Random Networks
- The complexity of theorem-proving procedures
- Finding efficient circuits for ensemble computation
- The community structure of SAT formulas
- Community branching for parallel portfolio SAT solvers
- Impact of Community Structure on SAT Solver Performance
- The fractal dimension of SAT formulas
- Using Community Structure to Detect Relevant Learnt Clauses
- Exploiting resolution-based representations for MaxSAT solving
- Title not available (Why is that?)
- Hyperbolic graph generator
- Community-Based Partitioning for MaxSAT Solving
- Ten challenges \textit{redux}: recent progress in propositional reasoning and search
Cited In (14)
- Impact of Community Structure on SAT Solver Performance
- On the hierarchical community structure of practical Boolean formulas
- A model of random industrial SAT
- Solving non-uniform planted and filtered random SAT formulas greedily
- Popularity-similarity random SAT formulas
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden
- Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth
- Learning a propagation complete formula
- New models for generating hard random Boolean formulas and disjunctive logic programs
- The community structure of SAT formulas
- The fractal dimension of SAT formulas
- On the hardness of SAT with community structure
- Community structure in industrial SAT instances
- Satisfiability threshold for power law random 2-SAT in configuration model
Uses Software
This page was built for publication: Generating SAT instances with community structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q309919)
