<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>CVC3: search_theorem_producer.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">CVC3 <span id="projectnumber">2.4.1</span></div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<div class="header">
<div class="headertitle">
<div class="title">search_theorem_producer.h</div> </div>
</div>
<div class="contents">
<a href="search__theorem__producer_8h.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*****************************************************************************/</span><span class="comment"></span>
<a name="l00002"></a>00002 <span class="comment">/*!</span>
<a name="l00003"></a>00003 <span class="comment"> * \file search_theorem_producer.h</span>
<a name="l00004"></a>00004 <span class="comment"> * \brief Implementation API to proof rules for the simple search engine</span>
<a name="l00005"></a>00005 <span class="comment"> * </span>
<a name="l00006"></a>00006 <span class="comment"> * Author: Sergey Berezin</span>
<a name="l00007"></a>00007 <span class="comment"> * </span>
<a name="l00008"></a>00008 <span class="comment"> * Created: Mon Feb 24 14:48:03 2003</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * <hr></span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * License to use, copy, modify, sell and/or distribute this software</span>
<a name="l00013"></a>00013 <span class="comment"> * and its documentation for any purpose is hereby granted without</span>
<a name="l00014"></a>00014 <span class="comment"> * royalty, subject to the terms and conditions defined in the \ref</span>
<a name="l00015"></a>00015 <span class="comment"> * LICENSE file provided with this distribution.</span>
<a name="l00016"></a>00016 <span class="comment"> * </span>
<a name="l00017"></a>00017 <span class="comment"> * <hr></span>
<a name="l00018"></a>00018 <span class="comment"> * </span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 <span class="comment">/*****************************************************************************/</span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#ifndef _cvc3__search__search_theorem_producer_h_</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _cvc3__search__search_theorem_producer_h_</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="theorem__producer_8h.html">theorem_producer.h</a>"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include "<a class="code" href="search__rules_8h.html" title="Abstract proof rules interface to the simple search engine.">search_rules.h</a>"</span>
<a name="l00027"></a>00027
<a name="l00028"></a>00028 <span class="keyword">namespace </span>CVC3 {
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="keyword">class </span>CommonProofRules;
<a name="l00031"></a>00031
<a name="l00032"></a><a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html">00032</a> <span class="keyword">class </span><a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html">SearchEngineTheoremProducer</a>
<a name="l00033"></a>00033 : <span class="keyword">public</span> <a class="code" href="classCVC3_1_1SearchEngineRules.html" title="API to the proof rules for the Search Engines.">SearchEngineRules</a>,
<a name="l00034"></a>00034 <span class="keyword">public</span> <a class="code" href="classCVC3_1_1TheoremProducer.html">TheoremProducer</a> {
<a name="l00035"></a>00035 <span class="keyword">private</span>:
<a name="l00036"></a><a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#abb70faf5bb0eccda31e8ff06a46f2b65">00036</a> <a class="code" href="classCVC3_1_1CommonProofRules.html">CommonProofRules</a>* <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#abb70faf5bb0eccda31e8ff06a46f2b65">d_commonRules</a>;
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keywordtype">void</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#acaa4dd5cb5be1e9844e03c82feea84b6">verifyConflict</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm, <a class="code" href="namespaceCVC3.html#ae8220d283ddfdaa8f4e0da0a03fa7ff4">TheoremMap</a>& m);
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="keywordtype">void</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#aa12792d6b382598a0f5aeea983568a23">checkSoundNoSkolems</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& e, <a class="code" href="classCVC3_1_1ExprMap.html">ExprMap<bool></a>& visited,
<a name="l00041"></a>00041 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1ExprMap.html">ExprMap<bool></a>& skolems);
<a name="l00042"></a>00042 <span class="keywordtype">void</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#aa12792d6b382598a0f5aeea983568a23">checkSoundNoSkolems</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& t, <a class="code" href="classCVC3_1_1ExprMap.html">ExprMap<bool></a>& visited,
<a name="l00043"></a>00043 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1ExprMap.html">ExprMap<bool></a>& skolems);
<a name="l00044"></a>00044 <span class="keyword">public</span>:
<a name="l00045"></a>00045
<a name="l00046"></a>00046 <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#ad09ba717299f8684495e218548a43533">SearchEngineTheoremProducer</a>(<a class="code" href="classCVC3_1_1TheoremManager.html">TheoremManager</a>* tm);
<a name="l00047"></a>00047 <span class="comment">// Destructor</span>
<a name="l00048"></a><a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a4a91c61608f1df10cfd4b114986327c9">00048</a> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a4a91c61608f1df10cfd4b114986327c9">~SearchEngineTheoremProducer</a>() { }
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="comment">// Proof by contradiction: !A |- FALSE ==> |- A. "!A" doesn't</span>
<a name="l00051"></a>00051 <span class="comment">// have to be present in the assumptions.</span>
<a name="l00052"></a>00052 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a671a24b65b564dff6588925ecfcb5f60" title="Proof by contradiction: .">proofByContradiction</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& a,
<a name="l00053"></a>00053 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& pfFalse);
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="comment">// Similar rule, only negation introduction:</span>
<a name="l00056"></a>00056 <span class="comment">// A |- FALSE ==> !A</span>
<a name="l00057"></a>00057 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a7f69d40a18ab9b66200d24ccc92c2ae9" title="Negation introduction: .">negIntro</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& not_a, <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& pfFalse);
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="comment">// Case split: u1:A |- C, u2:!A |- C ==> |- C</span>
<a name="l00060"></a>00060 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a68990fddbfff890590e69e239a3110fe" title="Case split: .">caseSplit</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& a,
<a name="l00061"></a>00061 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_proves_c,
<a name="l00062"></a>00062 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& not_a_proves_c);
<a name="l00063"></a>00063
<a name="l00064"></a>00064
<a name="l00065"></a>00065
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="comment"></span>
<a name="l00068"></a>00068 <span class="comment"> /*! Eliminate skolem axioms: </span>
<a name="l00069"></a>00069 <span class="comment"> * Gamma, Delta |- false => Gamma|- false </span>
<a name="l00070"></a>00070 <span class="comment"> * where Delta is a set of skolem axioms {|-Exists(x) phi (x) => phi(c)}</span>
<a name="l00071"></a>00071 <span class="comment"> * and gamma does not contain any of the skolem constants c.</span>
<a name="l00072"></a>00072 <span class="comment"> */</span>
<a name="l00073"></a>00073 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#ac980b63fbd08b0e29b1092ed4aeb95e8">eliminateSkolemAxioms</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& tFalse,
<a name="l00074"></a>00074 <span class="keyword">const</span> std::vector<Theorem>& delta);
<a name="l00075"></a>00075
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="comment">// Conflict clause rule: </span>
<a name="l00078"></a>00078 <span class="comment">// Gamma, A_1,...,A_n |- B ==> Gamma |- (OR B !A_1 ... !A_n)</span>
<a name="l00079"></a>00079 <span class="comment">// The assumptions A_i are given by the vector 'lits'.</span>
<a name="l00080"></a>00080 <span class="comment">// If B==FALSE, it is omitted from the result.</span>
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="comment">// NOTE: here "!A_i" means an inverse of A_i, not just a negation.</span>
<a name="l00083"></a>00083 <span class="comment">// That is, if A_i is NOT C, then !A_i is C.</span>
<a name="l00084"></a>00084
<a name="l00085"></a>00085 <span class="comment">// NOTE: Theorems with same expressions must </span>
<a name="l00086"></a>00086 <span class="comment">// be eliminated before passing as lits.</span>
<a name="l00087"></a>00087 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#abf46962b0eb1ff204a5b321828139713" title="Conflict clause rule: .">conflictClause</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm,
<a name="l00088"></a>00088 <span class="keyword">const</span> std::vector<Theorem>& lits,
<a name="l00089"></a>00089 <span class="keyword">const</span> std::vector<Theorem>& gamma);
<a name="l00090"></a>00090
<a name="l00091"></a>00091 <span class="comment">// "Cut" rule: { G_i |- A_i }; G', { A_i } |- B ==> union(G_i)+G' |- B.</span>
<a name="l00092"></a>00092 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a9be0036e770d071001f7afab845f0473" title="Cut rule: .">cutRule</a>(<span class="keyword">const</span> std::vector<Theorem>& thmsA,
<a name="l00093"></a>00093 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& as_prove_b);
<a name="l00094"></a>00094
<a name="l00095"></a>00095 <span class="comment">// "Unit propagation" rule:</span>
<a name="l00096"></a>00096 <span class="comment">// G_j |- !l_j, j in [1..n]-{i}</span>
<a name="l00097"></a>00097 <span class="comment">// G |- (OR l_1 ... l_i ... l_n) ==> G, G_j |- l_i</span>
<a name="l00098"></a>00098 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#af764cf6eae285f0dbd3d430b76c5e19d" title="Unit propagation rule: .">unitProp</a>(<span class="keyword">const</span> std::vector<Theorem>& thms,
<a name="l00099"></a>00099 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& clause, <span class="keywordtype">unsigned</span> i);
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="comment">// "Conflict" rule (all literals in a clause become FALSE)</span>
<a name="l00102"></a>00102 <span class="comment">// { G_j |- !l_j, j in [1..n] } , G |- (OR l_1 ... l_n) ==> FALSE</span>
<a name="l00103"></a>00103 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a55bf4e865a7a76e82c23d5fba566b853" title=""Conflict" rule (all literals in a clause become FALSE) ">conflictRule</a>(<span class="keyword">const</span> std::vector<Theorem>& thms,
<a name="l00104"></a>00104 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& clause);
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="comment">// Unit propagation for AND</span>
<a name="l00107"></a>00107 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a1d0f21b895fc25bff5dc653490a775c0">propAndrAF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00108"></a>00108 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00109"></a>00109 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th);
<a name="l00110"></a>00110
<a name="l00111"></a>00111 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a22c592b3807cddf270b7be995594d58a">propAndrAT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00112"></a>00112 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00113"></a>00113 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th);
<a name="l00114"></a>00114
<a name="l00115"></a>00115
<a name="l00116"></a>00116 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a1bdf01b6d0e85d8c91a2fa3aaf0704c6">propAndrLRT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00117"></a>00117 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00118"></a>00118 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* l_th,
<a name="l00119"></a>00119 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* r_th);
<a name="l00120"></a>00120
<a name="l00121"></a>00121 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a373b85c528799a04c9997f8f0b1349d6">propAndrLF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00122"></a>00122 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00123"></a>00123 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th);
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a948eaf2519eb12dd8f76c3c890babd78">propAndrRF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00126"></a>00126 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00127"></a>00127 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th);
<a name="l00128"></a>00128
<a name="l00129"></a>00129 <span class="comment">// Conflicts for AND</span>
<a name="l00130"></a>00130 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a8b6dd7f1001b52a5be21914e1ecf6da0">confAndrAT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00131"></a>00131 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00132"></a>00132 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00133"></a>00133 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th);
<a name="l00134"></a>00134
<a name="l00135"></a>00135 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a09acd80b1c336ac225de0a71bee0d4c8">confAndrAF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00136"></a>00136 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00137"></a>00137 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00138"></a>00138 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th);
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="comment">// Unit propagation for IFF</span>
<a name="l00141"></a>00141 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#afb6d1f50a0b2cf48bf98517731160595">propIffr</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iffr_th,
<a name="l00142"></a>00142 <span class="keywordtype">int</span> p,
<a name="l00143"></a>00143 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00144"></a>00144 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th);
<a name="l00145"></a>00145
<a name="l00146"></a>00146 <span class="comment">// Conflicts for IFF</span>
<a name="l00147"></a>00147 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#afc1db7951ca830c313d2cef522e45f25">confIffr</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iffr_th,
<a name="l00148"></a>00148 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& i_th,
<a name="l00149"></a>00149 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00150"></a>00150 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th);
<a name="l00151"></a>00151
<a name="l00152"></a>00152 <span class="comment">// Unit propagation for ITE</span>
<a name="l00153"></a>00153 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a9964535eb830bbc87e91f40e71333dfa">propIterIte</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00154"></a>00154 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00155"></a>00155 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th,
<a name="l00156"></a>00156 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th);
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a9c5271d8f47048c4573e21bfd21bc8a7">propIterIfThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00159"></a>00159 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00160"></a>00160 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00161"></a>00161 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th,
<a name="l00162"></a>00162 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* if_th,
<a name="l00163"></a>00163 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* else_th);
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#aa3a9dce562278a5383f4551d95b12c3a">propIterThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00166"></a>00166 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00167"></a>00167 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th);
<a name="l00168"></a>00168
<a name="l00169"></a>00169 <span class="comment">// Conflicts for ITE</span>
<a name="l00170"></a>00170 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#aaf56546de0c7c7bbe0b573477d412bf7">confIterThenElse</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00171"></a>00171 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00172"></a>00172 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th,
<a name="l00173"></a>00173 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& else_th);
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#aad519346f53864cc21109200379a3698">confIterIfThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00176"></a>00176 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00177"></a>00177 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00178"></a>00178 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th,
<a name="l00179"></a>00179 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th);
<a name="l00180"></a>00180
<a name="l00181"></a>00181 <span class="comment">// CNF Rules</span>
<a name="l00182"></a>00182 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#af38d03174800bca0baba91f4e8288b0f" title="AND(x1,...,xn) <=> v |- CNF[AND(x1,...,xn) <=> v].">andCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm);
<a name="l00183"></a>00183 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a3cf33a58eee64dc744015e8657adc40a" title="OR(x1,...,xn) <=> v |- CNF[OR(x1,...,xn) <=> v].">orCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm);
<a name="l00184"></a>00184 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a15cbb86a5a77422c7d8c59384488f9e1" title="(x1 => x2) <=> v |- CNF[(x1 => x2) <=> v]">impCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm);
<a name="l00185"></a>00185 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a47468ab81771bdb7af900bd2f907f818" title="(x1 <=> x2) <=> v |- CNF[(x1 <=> x2) <=> v]">iffCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm);
<a name="l00186"></a>00186 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a1c37ba3237f04f7536164166c7f0156e" title="ITE(c, x1, x2) <=> v |- CNF[ITE(c, x1, x2) <=> v].">iteCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm);
<a name="l00187"></a>00187 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a9ec94eac3bdabe251a4147b2830a2f50" title="ITE(c, f1, f2) |- (NOT c OR f1) AND (c OR f2)">iteToClauses</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite);
<a name="l00188"></a>00188 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#ab608d81ddbbce71638fcce0d119c63d1" title="e1 <=> e2 |- (NOT e1 OR e2) AND (e1 OR NOT e2)">iffToClauses</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iff);
<a name="l00189"></a>00189
<a name="l00190"></a>00190 <span class="comment">//theorrm for minisat proofs, by yeting</span>
<a name="l00191"></a>00191 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a211e687727973cff1b055a7302d562ae">satProof</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& queryExpr, <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Proof.html">Proof</a>& <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a211e687727973cff1b055a7302d562ae">satProof</a>);
<a name="l00192"></a>00192 <span class="comment"></span>
<a name="l00193"></a>00193 <span class="comment"> /////////////////////////////////////////////////////////////////////////</span>
<a name="l00194"></a>00194 <span class="comment"> //// helper functions for CNF (Conjunctive Normal Form) conversion</span>
<a name="l00195"></a>00195 <span class="comment"> /////////////////////////////////////////////////////////////////////////</span>
<a name="l00196"></a>00196 <span class="comment"></span> <span class="keyword">private</span>:
<a name="l00197"></a>00197 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#afd9835d232286f451200d637ba995e75">opCNFRule</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm, <span class="keywordtype">int</span> kind,
<a name="l00198"></a>00198 <span class="keyword">const</span> std::string& ruleName);
<a name="l00199"></a>00199
<a name="l00200"></a>00200 <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a8ad94f1a94fd5bf8fa10dbf26e04ee58" title="produces the CNF for the formula v <==> phi">convertToCNF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& v, <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a> & phi);
<a name="l00201"></a>00201 <span class="comment"></span>
<a name="l00202"></a>00202 <span class="comment"> //! checks if phi has v in local cache of opCNFRule, if so reuse v.</span>
<a name="l00203"></a>00203 <span class="comment"></span><span class="comment"> /*! similarly for ( ! ... ! (phi)) */</span>
<a name="l00204"></a>00204 <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a> <a class="code" href="classCVC3_1_1SearchEngineTheoremProducer.html#a4af17425aaf7d8a28aaf1d8a09241535" title="checks if phi has v in local cache of opCNFRule, if so reuse v.">findInLocalCache</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Expr.html" title="Data structure of expressions in CVC3.">Expr</a>& i,
<a name="l00205"></a>00205 <a class="code" href="classCVC3_1_1ExprMap.html">ExprMap<Expr></a>& localCache,
<a name="l00206"></a>00206 std::vector<Expr>& boundVars);
<a name="l00207"></a>00207
<a name="l00208"></a>00208 }; <span class="comment">// end of class SearchEngineRules</span>
<a name="l00209"></a>00209 } <span class="comment">// end of namespace CVC3</span>
<a name="l00210"></a>00210 <span class="preprocessor">#endif</span>
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Sep 7 2011 for CVC3 by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
