Research map / Learning theory and algorithms / Combinatorial and search optimization
Evolving Solutions to Community-Structured Satisfiability Formulas
Frank Neumann, Andrew M. Sutton
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase constraint density m/n from 2e toward 5e | (1+1) EA · Community attachment model, n=1000, s=100, p=3/4 | proportion solved (run length distribution) | Improved |
| use uniform community densities instead of non-uniform (dense/sparse) communities | (1+1) EA · Community attachment model, p in {3/4, 1/4} | median run time / n ln n | No clear effect |
| vary localized clause probability p between 3/4 and 1/4 | (1+1) EA · Community attachment model, eps=1/5 | median run time / n ln n | No clear effect |
Closest papers by meaning
- Certified Symmetry and Dominance Breaking for Combinatorial Optimisation (AAAI 2022 · similarity 0.85)
- DiverSAT: A Novel and Effective Local Search Algorithm for Diverse SAT Problem (AAAI 2025 · similarity 0.85)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.84)
- Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms (AAAI 2020 · similarity 0.84)
- On the Expressive Power of GNNs for Boolean Satisfiability (ICLR 2026 · similarity 0.84)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
