Skip to search formSkip to main contentSkip to account menu

LowerUnits

In proof compression LowerUnits (LU) is an algorithm used to compress propositional logic resolution proofs. The main idea of LowerUnits is to… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations

Broader (1)

Automated theorem proving
Clause (logic)Directed acyclic graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Propositional Resolution Proofs And Raw Data Of Experimental Results
This dataset contains propositional resolution proofs generated by the SMT-solver VeriT on problems of the Sat-Race 2010 and on… 
2015
2015
Towards the Compression of First-Order Resolution Proofs by Lowering Unit Clauses
The recently developed LowerUnits algorithm compresses propositional resolution proofs generated by SAT- and SMT-solvers by… 
2011
2011
Compression of Propositional Resolution Proofs via Partial Regularization
This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivots… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)