The paper proposes persistent caching of component data and adapted branching heuristics to amortize computation in incremental #SAT, showing performance gains on argumentation and soft core problems.
Valiant , title =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
citing papers explorer
-
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
The paper proposes persistent caching of component data and adapted branching heuristics to amortize computation in incremental #SAT, showing performance gains on argumentation and soft core problems.
- Efficient Temporal Datalog Materialisation for Composite Event Recognition