Everything About ___
Live briefing

Everything about 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 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. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: RecycleUnitsA 5-minute orientation
  2. Go sideways: Finite strain theoryA closely related topic
  3. Go sideways: ♯P-completeness of 01-permanentA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Algorithms
  2. Example

🏆 Landmark papers (most cited)

📚 Books worth reading

Open Library didn't respond; try again in a moment.

đź”— Related topics