RecycleUnits
In mathematical logic, proof compression by RecycleUnits is a method for compressing propositional logic resolution proofs.Its main idea is to make use of intermediate (e.g. non input) proof results being unit clauses, i.e. clauses containing only one literal. Certain proof nodes can be replaced with the nodes representing these unit clauses.After this operation the obtained graph is transformed into a valid proof.The output proof is shorter than the original while being equivalent or stronger.
Link from a Wikipage to another Wikipage
primaryTopic
RecycleUnits
In mathematical logic, proof compression by RecycleUnits is a method for compressing propositional logic resolution proofs.Its main idea is to make use of intermediate (e.g. non input) proof results being unit clauses, i.e. clauses containing only one literal. Certain proof nodes can be replaced with the nodes representing these unit clauses.After this operation the obtained graph is transformed into a valid proof.The output proof is shorter than the original while being equivalent or stronger.
has abstract
In mathematical logic, proof c ...... being equivalent or stronger.
@en
Wikipage page ID
39,283,667
page length (characters) of wiki page
Wikipage revision ID
960,693,892
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In mathematical logic, proof c ...... being equivalent or stronger.
@en
label
RecycleUnits
@en