Everything About ___
Live briefing

Everything about Resolution proof compression by splitting

In mathematical logic, proof compression by splitting is an algorithm that operates as a post-process on resolution proofs. It was proposed by Scott Cotton in his paper "Two Techniques for Minimizing Resolution Proof". Wikipedia →

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

  1. Read the overview: Resolution proof compression by splittingA 5-minute orientation
  2. Pick up a classic book: Real world Adobe Photoshop CS5 for photographersThe most-reprinted book on the subject
  3. Go sideways: Cardinal functionA closely related topic
  4. Go sideways: Ext functorA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

No outline available.

🏆 Landmark papers (most cited)

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics