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.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative 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.