Compression of Propositional Resolution Proofs via Partial Regularization - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Compression of Propositional Resolution Proofs via Partial Regularization

(1) , (1) , (1)
1

Abstract

This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm performs partial regularization, removing an inference $\eta$ when it is redundant in the sense that its pivot literal already occurs as the pivot of another inference located below in the path from $\eta$ to the root of the proof. The second algorithm delays the resolution of (both input and derived) unit clauses, thus removing (some) inferences having the same pivot but possibly occurring also in different branches of the proof.

Dates and versions

inria-00617846 , version 1 (30-08-2011)

Identifiers

Cite

Pascal Fontaine, Stephan Merz, Bruno Woltzenlogel Paleo. Compression of Propositional Resolution Proofs via Partial Regularization. 23rd International Conference on Automated Deduction - CADE-23, Jul 2011, Wroclaw, Poland. pp.237-251, ⟨10.1007/978-3-642-22438-6_19⟩. ⟨inria-00617846⟩
55 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More