<!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_rules.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_rules.h</div> </div>
</div>
<div class="contents">
<a href="search__rules_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_rules.h</span>
<a name="l00004"></a>00004 <span class="comment"> * \brief Abstract proof rules interface to 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:19:48 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_rules_h_</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#define _cvc3__search__search_rules_h_</span>
<a name="l00024"></a>00024 <span class="preprocessor"></span>
<a name="l00025"></a>00025 <span class="keyword">namespace </span>CVC3 {
<a name="l00026"></a>00026
<a name="l00027"></a>00027 <span class="keyword">class </span>Theorem;
<a name="l00028"></a>00028 <span class="keyword">class </span>Expr;
<a name="l00029"></a>00029 <span class="comment"></span>
<a name="l00030"></a>00030 <span class="comment">/*! \defgroup SE_Rules Proof Rules for the Search Engines</span>
<a name="l00031"></a>00031 <span class="comment"> * \ingroup SE</span>
<a name="l00032"></a>00032 <span class="comment"> */</span><span class="comment"></span>
<a name="l00033"></a>00033 <span class="comment"> //! API to the proof rules for the Search Engines</span>
<a name="l00034"></a>00034 <span class="comment"></span><span class="comment"> /*! \ingroup SE_Rules */</span>
<a name="l00035"></a><a class="code" href="classCVC3_1_1SearchEngineRules.html">00035</a> <span class="keyword">class </span><a class="code" href="classCVC3_1_1SearchEngineRules.html" title="API to the proof rules for the Search Engines.">SearchEngineRules</a> {<span class="comment"></span>
<a name="l00036"></a>00036 <span class="comment"> /*! \addtogroup SE_Rules</span>
<a name="l00037"></a>00037 <span class="comment"> * @{ </span>
<a name="l00038"></a>00038 <span class="comment"> */</span>
<a name="l00039"></a>00039 <span class="keyword">public</span>:<span class="comment"></span>
<a name="l00040"></a>00040 <span class="comment"> //! Destructor</span>
<a name="l00041"></a><a class="code" href="group__SE__Rules.html#gae48ac99bc858fb09857649a89af81f43">00041</a> <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="group__SE__Rules.html#gae48ac99bc858fb09857649a89af81f43" title="Destructor.">~SearchEngineRules</a>() { }
<a name="l00042"></a>00042 <span class="comment"></span>
<a name="l00043"></a>00043 <span class="comment"> /*! Eliminate skolem axioms: </span>
<a name="l00044"></a>00044 <span class="comment"> * Gamma, Delta |- false => Gamma|- false </span>
<a name="l00045"></a>00045 <span class="comment"> * where Delta is a set of skolem axioms {|-Exists(x) phi (x) => phi(c)}</span>
<a name="l00046"></a>00046 <span class="comment"> * and gamma does not contain any of the skolem constants c.</span>
<a name="l00047"></a>00047 <span class="comment"> */</span>
<a name="l00048"></a>00048 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga3ddf95924d2ff2efb59e84dc78a19821">eliminateSkolemAxioms</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& tFalse,
<a name="l00049"></a>00049 <span class="keyword">const</span> std::vector<Theorem>& delta) = 0;
<a name="l00050"></a>00050
<a name="l00051"></a>00051 <span class="comment">// !A |- FALSE ==> |- A</span><span class="comment"></span>
<a name="l00052"></a>00052 <span class="comment"> /*! @brief Proof by contradiction: </span>
<a name="l00053"></a>00053 <span class="comment"> \f[\frac{\Gamma, \neg A \vdash\mathrm{FALSE}}{\Gamma \vdash A}\f]</span>
<a name="l00054"></a>00054 <span class="comment"> */</span><span class="comment"></span>
<a name="l00055"></a>00055 <span class="comment"> /*! \f$\neg A\f$ does not have to be present in the assumptions.</span>
<a name="l00056"></a>00056 <span class="comment"> * \param a is the assumption \e A</span>
<a name="l00057"></a>00057 <span class="comment"> *</span>
<a name="l00058"></a>00058 <span class="comment"> * \param pfFalse is the theorem \f$\Gamma, \neg A \vdash\mathrm{FALSE}\f$</span>
<a name="l00059"></a>00059 <span class="comment"> */</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="group__SE__Rules.html#ga64c9fb7058e52c324ce76f15fcea37e2" 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="l00061"></a>00061 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& pfFalse) = 0;
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="comment">// A |- FALSE ==> !A</span><span class="comment"></span>
<a name="l00064"></a>00064 <span class="comment"> /*! @brief Negation introduction:</span>
<a name="l00065"></a>00065 <span class="comment"> \f[\frac{\Gamma, A \vdash\mathrm{FALSE}}{\Gamma\vdash\neg A}\f]</span>
<a name="l00066"></a>00066 <span class="comment"> */</span><span class="comment"></span>
<a name="l00067"></a>00067 <span class="comment"> /*!</span>
<a name="l00068"></a>00068 <span class="comment"> * \param not_a is the formula \f$\neg A\f$. We pass the negation</span>
<a name="l00069"></a>00069 <span class="comment"> * \f$\neg A\f$, and not just \e A, for efficiency: building</span>
<a name="l00070"></a>00070 <span class="comment"> * \f$\neg A\f$ is more expensive (due to uniquifying pointers in</span>
<a name="l00071"></a>00071 <span class="comment"> * Expr package) than extracting \e A from \f$\neg A\f$.</span>
<a name="l00072"></a>00072 <span class="comment"> *</span>
<a name="l00073"></a>00073 <span class="comment"> * \param pfFalse is the theorem \f$\Gamma, A \vdash\mathrm{FALSE}\f$</span>
<a name="l00074"></a>00074 <span class="comment"> */</span>
<a name="l00075"></a>00075 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga846c2bdc33f6ff2080e76637ea618626" 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) = 0;
<a name="l00076"></a>00076
<a name="l00077"></a>00077 <span class="comment">// u1:A |- C, u2:!A |- C ==> |- C</span><span class="comment"></span>
<a name="l00078"></a>00078 <span class="comment"> /*! @brief Case split: </span>
<a name="l00079"></a>00079 <span class="comment"> \f[\frac{\Gamma_1, A\vdash C \quad \Gamma_2, \neg A\vdash C}</span>
<a name="l00080"></a>00080 <span class="comment"> {\Gamma_1\cup\Gamma_2\vdash C}\f]</span>
<a name="l00081"></a>00081 <span class="comment"> */</span><span class="comment"></span>
<a name="l00082"></a>00082 <span class="comment"> /*!</span>
<a name="l00083"></a>00083 <span class="comment"> * \param a is the assumption A to split on</span>
<a name="l00084"></a>00084 <span class="comment"> *</span>
<a name="l00085"></a>00085 <span class="comment"> * \param a_proves_c is the theorem \f$\Gamma_1, A\vdash C\f$</span>
<a name="l00086"></a>00086 <span class="comment"> *</span>
<a name="l00087"></a>00087 <span class="comment"> * \param not_a_proves_c is the theorem \f$\Gamma_2, \neg A\vdash C\f$</span>
<a name="l00088"></a>00088 <span class="comment"> */</span>
<a name="l00089"></a>00089 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga7db620d19846bd5947321a8d6f9e7da4" 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="l00090"></a>00090 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_proves_c,
<a name="l00091"></a>00091 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& not_a_proves_c) = 0;
<a name="l00092"></a>00092
<a name="l00093"></a>00093 <span class="comment">// Gamma, A_1,...,A_n |- FALSE ==> Gamma |- (OR !A_1 ... !A_n)</span><span class="comment"></span>
<a name="l00094"></a>00094 <span class="comment"> /*! @brief Conflict clause rule: </span>
<a name="l00095"></a>00095 <span class="comment"> \f[\frac{\Gamma,A_1,\ldots,A_n\vdash\mathrm{FALSE}}</span>
<a name="l00096"></a>00096 <span class="comment"> {\Gamma\vdash\neg A_1\vee\cdots\vee \neg A_n}\f]</span>
<a name="l00097"></a>00097 <span class="comment"> */</span><span class="comment"></span>
<a name="l00098"></a>00098 <span class="comment"> /*!</span>
<a name="l00099"></a>00099 <span class="comment"> * \param thm is the theorem</span>
<a name="l00100"></a>00100 <span class="comment"> * \f$\Gamma,A_1,\ldots,A_n\vdash\mathrm{FALSE}\f$</span>
<a name="l00101"></a>00101 <span class="comment"> *</span>
<a name="l00102"></a>00102 <span class="comment"> * \param lits is the vector of literals <em>A<sub>i</sub></em>.</span>
<a name="l00103"></a>00103 <span class="comment"> * They must be present in the set of assumptions of \e thm.</span>
<a name="l00104"></a>00104 <span class="comment"> *</span>
<a name="l00105"></a>00105 <span class="comment"> * \param gamma FIXME: document this!!</span>
<a name="l00106"></a>00106 <span class="comment"> */</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="group__SE__Rules.html#ga03be39f8ffe84a1bcc09bba60f45245c" title="Conflict clause rule: .">conflictClause</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& thm,
<a name="l00108"></a>00108 <span class="keyword">const</span> std::vector<Theorem>& lits,
<a name="l00109"></a>00109 <span class="keyword">const</span> std::vector<Theorem>& gamma) = 0;
<a name="l00110"></a>00110
<a name="l00111"></a>00111
<a name="l00112"></a>00112 <span class="comment">// "Cut" rule: { G_i |- A_i }; G', { A_i } |- B ==> union(G_i)+G' |- B.</span><span class="comment"></span>
<a name="l00113"></a>00113 <span class="comment"> /*! @brief Cut rule:</span>
<a name="l00114"></a>00114 <span class="comment"> \f[\frac{\Gamma_1\vdash A_1\quad\cdots\quad\Gamma_n\vdash A_n</span>
<a name="l00115"></a>00115 <span class="comment"> \quad \Gamma', A_1,\ldots,A_n\vdash B}</span>
<a name="l00116"></a>00116 <span class="comment"> {\bigcup_{i=1}^n\Gamma_i\cup\Gamma'\vdash B}\f]</span>
<a name="l00117"></a>00117 <span class="comment"> */</span><span class="comment"></span>
<a name="l00118"></a>00118 <span class="comment"> /*!</span>
<a name="l00119"></a>00119 <span class="comment"> * \param thmsA is a vector of theorems \f$\Gamma_i\vdash A_i\f$</span>
<a name="l00120"></a>00120 <span class="comment"> *</span>
<a name="l00121"></a>00121 <span class="comment"> * \param as_prove_b is the theorem </span>
<a name="l00122"></a>00122 <span class="comment"> * \f$\Gamma', A_1,\ldots,A_n\vdash B\f$</span>
<a name="l00123"></a>00123 <span class="comment"> * (the name means "A's prove B")</span>
<a name="l00124"></a>00124 <span class="comment"> */</span>
<a name="l00125"></a>00125 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gac1ef0687c058a3d4bd1d9ed88cd27abe" title="Cut rule: .">cutRule</a>(<span class="keyword">const</span> std::vector<Theorem>& thmsA,
<a name="l00126"></a>00126 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& as_prove_b) = 0;
<a name="l00127"></a>00127
<a name="l00128"></a>00128 <span class="comment">// { G_j |- !A_j, j in [1..n]-{i} }</span>
<a name="l00129"></a>00129 <span class="comment">// G |- (OR A_1 ... A_i ... A_n) ==> G, G_j |- A_i</span><span class="comment"></span>
<a name="l00130"></a>00130 <span class="comment"> /*! @brief Unit propagation rule:</span>
<a name="l00131"></a>00131 <span class="comment"> \f[\frac{\Gamma_j\vdash\neg A_j\mbox{ for }j\in[1\ldots n]-\{i\}</span>
<a name="l00132"></a>00132 <span class="comment"> \quad \Gamma\vdash A_1\vee\cdots\vee A_n}</span>
<a name="l00133"></a>00133 <span class="comment"> {\bigcup_{j\in[1\ldots n]-\{i\}}\Gamma_j\cup\Gamma\vdash A_i}\f]</span>
<a name="l00134"></a>00134 <span class="comment"> */</span><span class="comment"></span>
<a name="l00135"></a>00135 <span class="comment"> /*!</span>
<a name="l00136"></a>00136 <span class="comment"> * \param clause is the proof of the clause \f$ \Gamma\vdash</span>
<a name="l00137"></a>00137 <span class="comment"> * A_1\vee\cdots\vee A_n\f$</span>
<a name="l00138"></a>00138 <span class="comment"> *</span>
<a name="l00139"></a>00139 <span class="comment"> * \param i is the index (0..n-1) of the literal to be unit-propagated</span>
<a name="l00140"></a>00140 <span class="comment"> *</span>
<a name="l00141"></a>00141 <span class="comment"> * \param thms is the vector of theorems \f$\Gamma_j\vdash\neg</span>
<a name="l00142"></a>00142 <span class="comment"> * A_j\f$ for all literals except <em>A<sub>i</sub></em></span>
<a name="l00143"></a>00143 <span class="comment"> */</span>
<a name="l00144"></a>00144 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gae7221bb8b77313a9b53a4beca9cc0aa0" title="Unit propagation rule: .">unitProp</a>(<span class="keyword">const</span> std::vector<Theorem>& thms,
<a name="l00145"></a>00145 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& clause, <span class="keywordtype">unsigned</span> i) = 0;
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="comment">// { G_j |- !A_j, j in [1..n] } , G |- (OR A_1 ... A_n) ==> FALSE</span><span class="comment"></span>
<a name="l00148"></a>00148 <span class="comment"> /*! @brief "Conflict" rule (all literals in a clause become FALSE)</span>
<a name="l00149"></a>00149 <span class="comment"> \f[\frac{\Gamma_j\vdash\neg A_j\mbox{ for }j\in[1\ldots n]</span>
<a name="l00150"></a>00150 <span class="comment"> \quad \Gamma\vdash A_1\vee\cdots\vee A_n}</span>
<a name="l00151"></a>00151 <span class="comment"> {\bigcup_{j\in[1\ldots n]}\Gamma_j\cup\Gamma</span>
<a name="l00152"></a>00152 <span class="comment"> \vdash\mathrm{FALSE}}\f]</span>
<a name="l00153"></a>00153 <span class="comment"> */</span><span class="comment"></span>
<a name="l00154"></a>00154 <span class="comment"> /*!</span>
<a name="l00155"></a>00155 <span class="comment"> * \param clause is the proof of the clause \f$ \Gamma\vdash</span>
<a name="l00156"></a>00156 <span class="comment"> * A_1\vee\cdots\vee A_n\f$</span>
<a name="l00157"></a>00157 <span class="comment"> *</span>
<a name="l00158"></a>00158 <span class="comment"> * \param thms is the vector of theorems \f$\Gamma_j\vdash\neg</span>
<a name="l00159"></a>00159 <span class="comment"> * A_j\f$</span>
<a name="l00160"></a>00160 <span class="comment"> */</span>
<a name="l00161"></a>00161 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga9c74425b4471d411f58f16781951c441" title=""Conflict" rule (all literals in a clause become FALSE) ">conflictRule</a>(<span class="keyword">const</span> std::vector<Theorem>& thms,
<a name="l00162"></a>00162 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& clause) = 0;
<a name="l00163"></a>00163
<a name="l00164"></a>00164
<a name="l00165"></a>00165 <span class="comment">// Unit propagation for AND</span>
<a name="l00166"></a>00166 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gaf5a18f8bcdc2f71632f05bcfe0bc533e">propAndrAF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00167"></a>00167 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00168"></a>00168 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th) = 0;
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gac7998bdcac234b0f3dc202d44b49c69c">propAndrAT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00171"></a>00171 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00172"></a>00172 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th) = 0;
<a name="l00173"></a>00173
<a name="l00174"></a>00174
<a name="l00175"></a>00175 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="group__SE__Rules.html#gad0150b04c296a6b8e05579c1dbd365f8">propAndrLRT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00176"></a>00176 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00177"></a>00177 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* l_th,
<a name="l00178"></a>00178 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* r_th) = 0;
<a name="l00179"></a>00179
<a name="l00180"></a>00180 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga8c8fc73c8b0413f5ca3fa7d72e687f5b">propAndrLF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00181"></a>00181 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00182"></a>00182 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th) = 0;
<a name="l00183"></a>00183
<a name="l00184"></a>00184 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga1158c41e7b7ed199271391d4404ce1b2">propAndrRF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00185"></a>00185 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00186"></a>00186 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th) = 0;
<a name="l00187"></a>00187
<a name="l00188"></a>00188 <span class="comment">// Conflicts for AND</span>
<a name="l00189"></a>00189 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga09d987f2d81c19d798d7185b125879b6">confAndrAT</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00190"></a>00190 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00191"></a>00191 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00192"></a>00192 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th) = 0;
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gadb878db4f9d24a21b62f50df2713ecca">confAndrAF</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& andr_th,
<a name="l00195"></a>00195 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00196"></a>00196 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00197"></a>00197 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th) = 0;
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="comment">// Unit propagation for IFF</span>
<a name="l00200"></a>00200 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga9bc3e3eab4b1fe4fb2c0a0172ca25ee9">propIffr</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iffr_th,
<a name="l00201"></a>00201 <span class="keywordtype">int</span> p,
<a name="l00202"></a>00202 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& a_th,
<a name="l00203"></a>00203 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& b_th) = 0;
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <span class="comment">// Conflicts for IFF</span>
<a name="l00206"></a>00206 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gaef31b1a5f6d6e9f270a1ab28ee361b14">confIffr</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iffr_th,
<a name="l00207"></a>00207 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& i_th,
<a name="l00208"></a>00208 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& l_th,
<a name="l00209"></a>00209 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& r_th) = 0;
<a name="l00210"></a>00210
<a name="l00211"></a>00211 <span class="comment">// Unit propagation for ITE</span>
<a name="l00212"></a>00212 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga979ad08269cd2799993628eaaccc146f">propIterIte</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00213"></a>00213 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00214"></a>00214 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th,
<a name="l00215"></a>00215 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th) = 0;
<a name="l00216"></a>00216
<a name="l00217"></a>00217 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="group__SE__Rules.html#gad35217bbc9f4a27b4d23af173e9ea2c7">propIterIfThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00218"></a>00218 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00219"></a>00219 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00220"></a>00220 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th,
<a name="l00221"></a>00221 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* if_th,
<a name="l00222"></a>00222 <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>* else_th) = 0;
<a name="l00223"></a>00223
<a name="l00224"></a>00224 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gab7b07d3b350b2cc7f3f596233abb54ea">propIterThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00225"></a>00225 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00226"></a>00226 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th) = 0;
<a name="l00227"></a>00227
<a name="l00228"></a>00228 <span class="comment">// Conflict for ITE</span>
<a name="l00229"></a>00229 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gaae491d08949a1ec57981526c8e960119">confIterThenElse</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00230"></a>00230 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00231"></a>00231 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th,
<a name="l00232"></a>00232 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& else_th) = 0;
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga771471d7cbb2253bc32f2a8018bd7182">confIterIfThen</a>(<span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& iter_th,
<a name="l00235"></a>00235 <span class="keywordtype">bool</span> <a class="code" href="namespaceMiniSat.html#ad93cb56673487974071ed3b75bf4ea83">left</a>,
<a name="l00236"></a>00236 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& ite_th,
<a name="l00237"></a>00237 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& if_th,
<a name="l00238"></a>00238 <span class="keyword">const</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a>& then_th) = 0;
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="comment">// CNF Rules</span>
<a name="l00241"></a>00241 <span class="comment"></span>
<a name="l00242"></a>00242 <span class="comment"> //! AND(x1,...,xn) <=> v |- CNF[AND(x1,...,xn) <=> v]</span>
<a name="l00243"></a>00243 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gab183ff7d1013729d0d3e2dbe28686e3c" 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) = 0;<span class="comment"></span>
<a name="l00244"></a>00244 <span class="comment"> //! OR(x1,...,xn) <=> v |- CNF[OR(x1,...,xn) <=> v]</span>
<a name="l00245"></a>00245 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga7086aa693d2a3421bc349eca8e9938ba" 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) = 0;<span class="comment"></span>
<a name="l00246"></a>00246 <span class="comment"> //! (x1 => x2) <=> v |- CNF[(x1 => x2) <=> v]</span>
<a name="l00247"></a>00247 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga25f7b95c8ebce2be117d03a1c93d715f" 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) = 0;<span class="comment"></span>
<a name="l00248"></a>00248 <span class="comment"> //! (x1 <=> x2) <=> v |- CNF[(x1 <=> x2) <=> v]</span>
<a name="l00249"></a>00249 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga4ab7606744594db9050cb83fe6b73668" 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) = 0;<span class="comment"></span>
<a name="l00250"></a>00250 <span class="comment"> //! ITE(c, x1, x2) <=> v |- CNF[ITE(c, x1, x2) <=> v]</span>
<a name="l00251"></a>00251 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#gae9263cbcedf5def99b3c49ee6978497a" 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) = 0;<span class="comment"></span>
<a name="l00252"></a>00252 <span class="comment"> //! ITE(c, f1, f2) |- (NOT c OR f1) AND (c OR f2)</span>
<a name="l00253"></a>00253 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga9b9c0fe62505477b6ec9774c1b5b2494" 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) = 0;<span class="comment"></span>
<a name="l00254"></a>00254 <span class="comment"> //! e1 <=> e2 |- (NOT e1 OR e2) AND (e1 OR NOT e2)</span>
<a name="l00255"></a>00255 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga356cd5a36ede50921fbaa3bc7e222d4f" 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) = 0;
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Theorem.html">Theorem</a> <a class="code" href="group__SE__Rules.html#ga55daf0bf95530208f5abf9484ded9055">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="group__SE__Rules.html#ga55daf0bf95530208f5abf9484ded9055">satProof</a>) = 0;
<a name="l00258"></a>00258 <span class="comment"></span>
<a name="l00259"></a>00259 <span class="comment"> /*! @} */</span> <span class="comment">// end of SE_Rules</span>
<a name="l00260"></a>00260 }; <span class="comment">// end of class SearchEngineRules</span>
<a name="l00261"></a>00261
<a name="l00262"></a>00262 } <span class="comment">// end of namespace CVC3</span>
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <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>
