Compression of Propositional Resolution Proofs via Partial Regularization.¶
Fontaine, P., Merz, S., & Woltzenlogel Paleo, B. (2011). Compression of Propositional Resolution Proofs via Partial Regularization. CADE.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Resolution-Proof Redundancy
- For the node-count criterion used by Fontaine, Merz, and Woltzenlogel Paleo, a proof is redundant if another valid resolution proof derives the same or a subsuming root clause with strictly fewer nodes in its proof DAG.
This sourceThe `n = 3` total-node comparison is derived from the theorem's inference counts plus its displayed input clauses.
- For the node-count criterion used by Fontaine, Merz, and Woltzenlogel Paleo, a proof is redundant if another valid resolution proof derives the same or a subsuming root clause with strictly fewer nodes in its proof DAG.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:c1319d564f36 · see in the full table