Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Resolution proof reduction via local context rewriting
open-in-new
<p>In <a href="/facts/Proof_theory/kopBdQn9">proof theory</a>, an area of <a href="/facts/Mathematical_logic/SaI7Y3wN">mathematical logic</a>, resolution proof reduction via local context rewriting is a technique for resolution <a href="/facts/Proof_compression/1e1FmqNS">proof reduction</a> via local context <a href="/facts/Rewriting/9PHlnnnJ">rewriting</a>. This <a href="/facts/Proof_compression/1e1FmqNS">proof compression</a> method was presented as an algorithm named <i>ReduceAndReconstruct</i>, that operates as a post-processing of <a href="/facts/Resolution_(logic)/16uDqkcD">resolution</a> proofs. </p><p>ReduceAndReconstruct is based on a set of local proof rewriting rules that transform a subproof into an equivalent or stronger one. Each rule is defined to match a specific context. </p><p>A context involves two pivots ( p {\displaystyle p} and q {\displaystyle q} ) and five clauses ( α {\displaystyle \alpha } , β {\displaystyle \beta } , γ {\displaystyle \gamma } , δ {\displaystyle \delta } and η {\displaystyle \eta } ). The structure of a context is shown in (1). Note that this implies that p {\displaystyle p} is contained in β {\displaystyle \beta } and γ {\displaystyle \gamma } (with opposite polarity) and q {\displaystyle q} is contained in δ {\displaystyle \delta } and α {\displaystyle \alpha } (also with opposite polarity). </p> <table><tbody><tr><td> β γ δ p α η q {\displaystyle {\cfrac {{\cfrac {\beta \qquad \gamma }{\delta }}\,p\qquad \alpha }{\eta }}\,q} </td> <td></td> <td>1</td></tr></tbody></table> <p>The table below shows the rewriting rules proposed by Simone <i>et al.</i>. The idea of the algorithm is to reduce proof size by opportunistically applying these rules. </p> <table><tbody><tr><th>Context</th><th>Rule</th></tr><tr><td>Case A1: s ∉ α , t ∈ γ {\displaystyle s\notin \alpha ,t\in \gamma } </td><td><p> s t C s ¯ t D t C D var ( s ) t ¯ E C D E var ( t ) ⇒ s t C t ¯ E s C E var ( t ) t ¯ E s ¯ t D s ¯ D E var ( t ) C D E var ( s ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}tD}{tCD}}\,\operatorname {var} (s)\qquad {\overline {t}}E}{CDE}}\,\operatorname {var} (t)\Rightarrow {\cfrac {{\cfrac {stC\qquad {\overline {t}}E}{sCE}}\,\operatorname {var} (t)\qquad {\cfrac {{\overline {t}}E\qquad {\overline {s}}tD}{{\overline {s}}DE}}\,\operatorname {var} (t)}{CDE}}\,\operatorname {var} (s)} </p></td></tr><tr><td>Case A2: s ∉ α , t ∉ γ {\displaystyle s\notin \alpha ,t\notin \gamma } </td><td><p> s t C s ¯ D t C D var ( s ) t ¯ E C D E var ( t ) ⇒ s t C t ¯ E s C E var ( t ) s ¯ D C D E var ( s ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}D}{tCD}}\,\operatorname {var} (s)\qquad {\overline {t}}E}{CDE}}\,\operatorname {var} (t)\Rightarrow {\cfrac {{\cfrac {stC\qquad {\overline {t}}E}{sCE}}\,\operatorname {var} (t)\qquad {\overline {s}}D}{CDE}}\,\operatorname {var} (s)} </p></td></tr><tr><td>Case B1: s ∈ α , t ∈ γ {\displaystyle s\in \alpha ,t\in \gamma } </td><td><p> s t C s ¯ t D t C D var ( s ) s t ¯ E s C D E var ( t ) ⇒ s t C s t ¯ E s C E var ( t ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}tD}{tCD}}\,\operatorname {var} (s)\qquad s{\overline {t}}E}{sCDE}}\,\operatorname {var} (t)\Rightarrow {\cfrac {stC\qquad s{\overline {t}}E}{sCE}}\,\operatorname {var} (t)} </p></td></tr><tr><td>Case B2: s ∈ α , t ∉ γ {\displaystyle s\in \alpha ,t\notin \gamma } </td><td><p> s t C s ¯ D t D C var ( s ) s t ¯ E s C D E var ( t ) ⇒ s t C s t ¯ E s C E var ( t ) s ¯ D C D E var ( s ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}D}{tDC}}\,\operatorname {var} (s)\qquad s{\overline {t}}E}{sCDE}}\,\operatorname {var} (t)\Rightarrow {\cfrac {{\cfrac {stC\qquad s{\overline {t}}E}{sCE}}\,\operatorname {var} (t)\qquad {\overline {s}}D}{CDE}}\,\operatorname {var} (s)} </p></td></tr><tr><td>Case B3: s ¯ ∈ α , t ∉ γ {\displaystyle {\overline {s}}\in \alpha ,t\notin \gamma } </td><td><p> s t C s ¯ D t D C var ( s ) s ¯ t ¯ E s ¯ C D E var ( t ) ⇒ s ¯ D {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}D}{tDC}}\,\operatorname {var} (s)\qquad {\overline {s}}{\overline {t}}E}{{\overline {s}}CDE}}\,\operatorname {var} (t)\Rightarrow {\overline {s}}D} </p></td></tr><tr><td>Case A1'</td><td><p> s t C s ¯ t D t C D var ( s ) t ¯ E C D E var ( t ) ⇐ s t C t ¯ E s C E var ( t ) t ¯ E s ¯ t D s ¯ D E var ( t ) C D E var ( s ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}tD}{tCD}}\,\operatorname {var} (s)\qquad {\overline {t}}E}{CDE}}\,\operatorname {var} (t)\Leftarrow {\cfrac {{\cfrac {stC\qquad {\overline {t}}E}{sCE}}\,\operatorname {var} (t)\qquad {\cfrac {{\overline {t}}E\qquad {\overline {s}}tD}{{\overline {s}}DE}}\,\operatorname {var} (t)}{CDE}}\,\operatorname {var} (s)} </p></td></tr><tr><td>Case B2': t ∉ γ {\displaystyle t\notin \gamma } </td><td><p> s t C s ¯ D t C D var ( s ) s t ¯ E s C D E var ( t ) ⇒ s t C s t ¯ E s C E var ( t ) {\displaystyle {\cfrac {{\cfrac {stC\qquad {\overline {s}}D}{tCD}}\,\operatorname {var} (s)\qquad s{\overline {t}}E}{sCDE}}\,\operatorname {var} (t)\Rightarrow {\cfrac {stC\qquad s{\overline {t}}E}{sCE}}\,\operatorname {var} (t)} </p></td></tr></tbody></table> <p>The first five rules were introduced in an earlier paper. In addition: </p> <ul><li>Rule A2 does not perform any reduction on its own. However, it is still useful, because of its "shuffling" effect that can create new opportunities for applying the other rules;</li> <li>Rule A1 is not used in practice, because it may increase proof size;</li> <li>Rules B1, B2, B2' and B3 are directly responsible for the reduction, as they produce a transformed root clause stronger than the original one;</li> <li>The application of a B rule may lead to an illegal proof (see the example below), as some literals missing in the transformed root clause may be involved in another resolution step along the path to the proof root. Therefore, the algorithm also has to "reconstruct" a legal proof when this happen.</li></ul> <p>The following example shows a situation where the proof becomes illegal after the application of B2' rule: </p> <table><tbody><tr><td> p q p ¯ o q o p p q ¯ p o q q r p ¯ q ¯ p ¯ r q o r p o ¯ s r s o {\displaystyle {\cfrac {{\cfrac {{\cfrac {{\cfrac {\mathbf {pq} \qquad \mathbf {{\overline {p}}o} }{\mathbf {qo} }}\,p\qquad \mathbf {p{\overline {q}}} }{\mathbf {po} }}\,q\qquad {\cfrac {qr\qquad {\overline {p}}{\overline {q}}}{{\overline {p}}r}}\,q}{or}}\,p\qquad {\overline {o}}s}{rs}}\,o} </td> <td></td> <td>2</td></tr></tbody></table> <p>Applying rule B2' to the highlighted context: </p> <table><tbody><tr><td> p q p q ¯ p q q r p ¯ q ¯ p ¯ r q o r p o ¯ s r s o {\displaystyle {\cfrac {{\cfrac {{\cfrac {\mathbf {pq} \qquad \mathbf {p{\overline {q}}} }{\mathbf {p} }}\,q\qquad {\cfrac {qr\qquad {\overline {p}}{\overline {q}}}{{\overline {p}}r}}\,q}{or}}\,p\qquad {\overline {o}}s}{rs}}\,o} </td> <td></td> <td>3</td></tr></tbody></table> <p>The proof is now illegal because the literal o {\displaystyle o} is missing from the transformed root clause. To reconstruct the proof, one can remove o {\displaystyle o} together with the last resolution step (that is now redundant). The final result is the following legal (and stronger) proof: </p> <table><tbody><tr><td> p q p q ¯ p q q r p ¯ q ¯ p ¯ r q r p {\displaystyle {\cfrac {{\cfrac {pq\qquad p{\overline {q}}}{p}}\,q\qquad {\cfrac {qr\qquad {\overline {p}}{\overline {q}}}{{\overline {p}}r}}\,q}{r}}\,p} </td> <td></td> <td>4</td></tr></tbody></table> <p>A further reduction of this proof by applying rule A2 to create a new opportunity to apply rule B2'. </p><p>There are usually a huge number of contexts where rule A2 may be applied, so an exhaustive approach is not feasible in general. One proposal is to execute ReduceAndReconstruct as a loop with two termination criteria: number of iterations and a timeout (what is reached first). The pseudocode below shows this. </p> 1 function ReduceAndReconstruct(<i> π {\displaystyle \pi } </i> <i>/* a proof */</i>, <i>timelimit</i>, <i>maxIterations</i>): 2 for i = 1 to <i>maxIterations</i> do 3 ReduceAndReconstructLoop(); 4 if <i>time</i> > <i>timelimit</i> then <i>// timeout</i> 5 break; 6 end for 7 end function <p>ReduceAndReconstruct uses the function ReduceAndReconstructLoop, which is specified below. The first part of the algorithm does a <a href="/facts/Topological_ordering/VY7gNtYA">topological ordering</a> of the resolution graph (considering that edges goes from antecedentes to resolvents). This is done to ensure that each node is visited after its antecedents (this way, broken resolution steps are always found and fixed). </p> 1 function ReduceAndReconstructLoop(<i> π {\displaystyle \pi } </i> <i>/* a proof */</i>): 2 <i>TS</i> = TopologicalSorting( π {\displaystyle \pi } ); 3 for each node n {\displaystyle n} in <i>TS</i> 4 if n {\displaystyle n} is not a leaf 5 if <i> n piv ∈ n clause left {\displaystyle n_{\text{piv}}\in n_{\text{clause}}^{\text{left}}} and n piv ¯ ∈ n clause right {\displaystyle {\overline {n_{\text{piv}}}}\in n_{\text{clause}}^{\text{right}}} </i> then 6 n clause {\displaystyle n_{\text{clause}}} = Resolution( n clause left {\displaystyle n_{\text{clause}}^{\text{left}}} , n clause right {\displaystyle n_{\text{clause}}^{\text{right}}} ); 7 Determine left context of n {\displaystyle n} , if any; 8 Determine right context of n {\displaystyle n} , if any; 9 Heuristically choose one context (if any) and apply the corresponding rule; 10 else if <i> n piv ∉ n clause left {\displaystyle n_{\text{piv}}\notin n_{\text{clause}}^{\text{left}}} and n piv ¯ ∈ n clause right {\displaystyle {\overline {n_{\text{piv}}}}\in n_{\text{clause}}^{\text{right}}} </i> then 11 Substitute n {\displaystyle n} with n left {\displaystyle n^{\text{left}}} ; 12 else if <i> n piv ∈ n clause left {\displaystyle n_{\text{piv}}\in n_{\text{clause}}^{\text{left}}} and n piv ¯ ∉ n clause right {\displaystyle {\overline {n_{\text{piv}}}}\notin n_{\text{clause}}^{\text{right}}} </i> then 13 Substitute n {\displaystyle n} with n right {\displaystyle n^{\text{right}}} ; 14 else if <i> n piv ∉ n clause left {\displaystyle n_{\text{piv}}\notin n_{\text{clause}}^{\text{left}}} and n piv ¯ ∉ n clause right {\displaystyle {\overline {n_{\text{piv}}}}\notin n_{\text{clause}}^{\text{right}}} </i> then 15 Heuristically choose an antecedent n left {\displaystyle n^{\text{left}}} or n right {\displaystyle n^{\text{right}}} ; 16 Substitute n {\displaystyle n} with n left {\displaystyle n^{\text{left}}} or n right {\displaystyle n^{\text{right}}} ; 17 end for 18 end function <p>If the input proof is not a tree (in general, resolution graphs are <a href="/facts/Directed_acyclic_graph/k6zq1os9">directed acyclic graphs</a>), then the clause δ {\displaystyle \delta } of a context may be involved in more than one resolution step. In this case, to ensure that an application of a rewriting rule is not going to interfere with other resolution steps, a safe solution is to create a copy of the node represented by clause δ {\displaystyle \delta } . This solution increases proof size and some caution is needed when doing this. </p><p>The <a href="/facts/Heuristic/BcBEkv9c">heuristic</a> for rule selection is important to achieve a good compression performance. Simone <i>et al.</i> use the following order of preference for the rules (if applicable to the given context): B2 > B3 > { B2', B1 } > A1' > A2 (X > Y means that X is preferred over Y). </p><p>Experiments have shown that ReduceAndReconstruct alone has a worse compression/time ratio than the algorithm RecyclePivots. However, while RecyclePivots can be applied only once to a proof, ReduceAndReconstruct may be applied multiple times to produce a better compression. An attempt to combine ReduceAndReconstruct and RecyclePivots algorithms has led to good results. </p>