Resolution proof compression by splitting
id:
resolution-proof-compression-by-splitting-252-3100892
title:
Resolution proof compression by splitting
text:
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". The Splitting algorithm is based on the following observation: Given a proof of unsatisfiability π and a variable x , it is easy to re-arrange (split) the proof in a proof of x and a proof of ¬ x and the recombination of these two proofs may result in a proof smaller than the orig
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Resolution_proof_compression_by_splitting
date created:
date modified:
2017-07-16T00:13:41Z
main entity:
{"identifier":"Q7315698","url":"https://www.wikidata.org/entity/Q7315698"}
image:
fields total:
13
integrity:
13