LowerUnits
id:
lowerunits-237-8509279
title:
LowerUnits
text:
In proof compression LowerUnits (LU) is an algorithm used to compress propositional logic resolution proofs. The main idea of LowerUnits is to exploit the following fact: The algorithm targets exactly the class of global redundancy stemming from multiple resolutions with unit clauses. The algorithm takes its name from the fact that, when this rewriting is done and the resulting proof is displayed as a DAG, the unit node η appears lower than it used to appear in the original proof. A naive implem
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/LowerUnits
date created:
date modified:
2020-10-21T10:02:13Z
main entity:
{"identifier":"Q15964440","url":"https://www.wikidata.org/entity/Q15964440"}
image:
fields total:
13
integrity:
13