Research map / Learning theory and algorithms / Combinatorial and search optimization
Premise Set Caching for Enumerating Minimal Correction Subsets
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 |
|---|---|---|---|
| add premise set caching (ablation) | LBX · MCS enumeration, 811 instances (1800s limit) | number of MCSes enumerated | Helped |
| cache premise sets (LBX) instead of unsatisfiable cores (ELS) | MCS enumeration · MCS enumeration, 811 instances | number of MCSes enumerated | Helped |
| LBX with PS caching vs CLD | MCS enumeration · MCS enumeration, 811 instances | number of MCSes enumerated | Mixed |
Closest papers by meaning
- Disjoint Partial Enumeration without Blocking Clauses (AAAI 2024 · similarity 0.85)
- An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships (AAAI 2025 · similarity 0.84)
- A Variable Occurrence-Centric Framework for Inconsistency Handling (AAAI 2025 · similarity 0.84)
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming (AAAI 2024 · similarity 0.83)
- Submodel Enumeration for CTL Is Hard (AAAI 2024 · similarity 0.82)
- The Impact of Literal Sorting on Cardinality Constraint Encodings (AAAI 2025 · similarity 0.82)
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.