Research map / Learning theory and algorithms / Combinatorial and search optimization
Maximum Model Counting
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 self-composition k above 0 (bias sampling toward high-count witnesses) (ablation) | MaxCount · Sketch program synthesis benchmarks | good program found (>=95% inputs correct) | Helped |
| use MaxCount instead of MaxHS on MaxSAT competition benchmarks | MaxSAT · 2016 MaxSAT competition | cost upper bound: 1576 -> 1552 | Mixed |
| use MaxCount's self-composed sampling instead of the Heusser-Malacaria exponential method | QIF leak analysis · QIF benchmarks | leak bound within 4 bits | Helped |
| encode MAP as Max#SAT and solve with MaxCount | UAI MAP instances · UAI competition | competitiveness vs existing approaches | Hurt |
| use random public inputs (k=0) on QIF with backdoors (ablation) | MaxCount · QIF pwd-backdoor etc. | minimal k needed | Hurt |
Closest papers by meaning
- Model Counting and Sampling via Semiring Extensions (AAAI 2024 · similarity 0.90)
- Towards Real-Time Approximate Counting (AAAI 2025 · similarity 0.88)
- Auditable Algorithms for Approximate Model Counting (AAAI 2024 · similarity 0.87)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.87)
- Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph (AAAI 2024 · similarity 0.86)
- Engineering an Exact Pseudo-Boolean Model Counter (AAAI 2024 · similarity 0.86)
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.