<!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: dpllt.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">dpllt.h</div> </div>
</div>
<div class="contents">
<a href="dpllt_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 dpllt.h</span>
<a name="l00004"></a>00004 <span class="comment"> *\brief Generic DPLL(T) module</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Author: Clark Barrett</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> * Created: Mon Dec 12 16:28:08 2005</span>
<a name="l00009"></a>00009 <span class="comment"> */</span>
<a name="l00010"></a>00010 <span class="comment">/*****************************************************************************/</span>
<a name="l00011"></a>00011
<a name="l00012"></a>00012 <span class="preprocessor">#ifndef _cvc3__include__dpllt_h_</span>
<a name="l00013"></a>00013 <span class="preprocessor"></span><span class="preprocessor">#define _cvc3__include__dpllt_h_</span>
<a name="l00014"></a>00014 <span class="preprocessor"></span>
<a name="l00015"></a>00015 <span class="preprocessor">#include "<a class="code" href="queryresult_8h.html" title="enumerated type for result of queries">queryresult.h</a>"</span>
<a name="l00016"></a>00016 <span class="preprocessor">#include "<a class="code" href="cnf_8h.html" title="Basic classes for reasoning about formulas in CNF.">cnf.h</a>"</span>
<a name="l00017"></a>00017 <span class="preprocessor">#include "<a class="code" href="cnf__manager_8h.html" title="Manager for conversion to and traversal of CNF formulas.">cnf_manager.h</a>"</span>
<a name="l00018"></a>00018 <span class="preprocessor">#include "<a class="code" href="proof_8h.html">proof.h</a>"</span>
<a name="l00019"></a>00019 <span class="preprocessor">#include "<a class="code" href="theory__core_8h.html">theory_core.h</a>"</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="keyword">namespace </span>SAT {
<a name="l00022"></a>00022
<a name="l00023"></a><a class="code" href="classSAT_1_1DPLLT.html">00023</a> <span class="keyword">class </span><a class="code" href="classSAT_1_1DPLLT.html">DPLLT</a> {
<a name="l00024"></a>00024 <span class="keyword">public</span>:
<a name="l00025"></a>00025
<a name="l00026"></a><a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8ab418da559e5bf8e1e7bb7f21dbd1b8ac">00026</a> <span class="keyword">enum</span> <a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8">ConsistentResult</a> {<a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8a1dbdf8ba98f0b618f9f4dffcbc947f95">INCONSISTENT</a>, <a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8ab418da559e5bf8e1e7bb7f21dbd1b8ac">MAYBE_CONSISTENT</a>, <a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8ae8ec5d9933decee81ba80f5bd5cfbed2">CONSISTENT</a> };
<a name="l00027"></a>00027
<a name="l00028"></a><a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html">00028</a> <span class="keyword">class </span><a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html">TheoryAPI</a> {
<a name="l00029"></a>00029 <span class="keyword">public</span>:
<a name="l00030"></a><a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a87a03cac4fa22a6211ff22ff2bedefef">00030</a> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a87a03cac4fa22a6211ff22ff2bedefef">TheoryAPI</a>() {}
<a name="l00031"></a><a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a74605aae23f2c5b78c220bd37a02d6d0">00031</a> <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a74605aae23f2c5b78c220bd37a02d6d0">~TheoryAPI</a>() {}
<a name="l00032"></a>00032 <span class="comment"></span>
<a name="l00033"></a>00033 <span class="comment"> //! Set a checkpoint for backtracking</span>
<a name="l00034"></a>00034 <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a771e84ea6308cb7d3f7d02e7858b37db" title="Set a checkpoint for backtracking.">push</a>() = 0;<span class="comment"></span>
<a name="l00035"></a>00035 <span class="comment"> //! Restore most recent checkpoint</span>
<a name="l00036"></a>00036 <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a51a08aab04c2185513676a316aee14b4" title="Restore most recent checkpoint.">pop</a>() = 0;
<a name="l00037"></a>00037 <span class="comment"></span>
<a name="l00038"></a>00038 <span class="comment"> //! Notify theory when a literal is set to true</span>
<a name="l00039"></a>00039 <span class="comment"></span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a3b3ef70567e0298cd3e971fd57d26fa6" title="Notify theory when a literal is set to true.">assertLit</a>(<a class="code" href="classSAT_1_1Lit.html">Lit</a> l) = 0;
<a name="l00040"></a>00040 <span class="comment"></span>
<a name="l00041"></a>00041 <span class="comment"> //! Check consistency of the current assignment.</span>
<a name="l00042"></a>00042 <span class="comment"></span><span class="comment"> /*! The result is either INCONSISTENT, MAYBE_CONSISTENT, or CONSISTENT</span>
<a name="l00043"></a>00043 <span class="comment"> * Most of the time, fullEffort should be false, and the result will most</span>
<a name="l00044"></a>00044 <span class="comment"> * likely be either INCONSISTENT or MAYBE_CONSISTENT. To force a full</span>
<a name="l00045"></a>00045 <span class="comment"> * check, set fullEffort to true. When fullEffort is set to true, the</span>
<a name="l00046"></a>00046 <span class="comment"> * only way the result can be MAYBE_CONSISTENT is if there are new clauses</span>
<a name="l00047"></a>00047 <span class="comment"> * to get (via getNewClauses).</span>
<a name="l00048"></a>00048 <span class="comment"> * \param cnf should be empty initially. If INCONSISTENT is returned,</span>
<a name="l00049"></a>00049 <span class="comment"> * then cnf will contain one or more clauses ruling out the current</span>
<a name="l00050"></a>00050 <span class="comment"> * assignment when it returns. Otherwise, cnf is unchanged.</span>
<a name="l00051"></a>00051 <span class="comment"> * \param fullEffort true for a full check, false for a fast check</span>
<a name="l00052"></a>00052 <span class="comment"> */</span>
<a name="l00053"></a>00053 <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1DPLLT.html#ac612908684032ffe76ad97f04afd0ca8">ConsistentResult</a> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a4b3f4a97dbac21236e479a157d866545" title="Check consistency of the current assignment.">checkConsistent</a>(<a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& cnf, <span class="keywordtype">bool</span> fullEffort) = 0;
<a name="l00054"></a>00054
<a name="l00055"></a>00055 <span class="comment"></span>
<a name="l00056"></a>00056 <span class="comment"> //! Check if the work budget has been exceeded</span>
<a name="l00057"></a>00057 <span class="comment"></span><span class="comment"> /*! If true, it means that the engine should quit and return ABORT.</span>
<a name="l00058"></a>00058 <span class="comment"> * Otherwise, it should proceed normally. This should be checked regularly.</span>
<a name="l00059"></a>00059 <span class="comment"> */</span>
<a name="l00060"></a>00060 <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a6484231750edf5bd9d10d9408c6b5a59" title="Check if the work budget has been exceeded.">outOfResources</a>() = 0;
<a name="l00061"></a>00061 <span class="comment"></span>
<a name="l00062"></a>00062 <span class="comment"> //! Get a literal that is implied by the current assignment.</span>
<a name="l00063"></a>00063 <span class="comment"></span><span class="comment"> /*! This is theory propagation. It can be called repeatedly and returns a</span>
<a name="l00064"></a>00064 <span class="comment"> * Null literal when there are no more literals to propagate. It should</span>
<a name="l00065"></a>00065 <span class="comment"> * only be called when the assignment is not known to be inconsistent.</span>
<a name="l00066"></a>00066 <span class="comment"> */</span>
<a name="l00067"></a>00067 <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1Lit.html">Lit</a> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#ad61236a10860b9771e1e09505ab501b5" title="Get a literal that is implied by the current assignment.">getImplication</a>() = 0;
<a name="l00068"></a>00068 <span class="comment"></span>
<a name="l00069"></a>00069 <span class="comment"> //! Get an explanation for a literal that was implied</span>
<a name="l00070"></a>00070 <span class="comment"></span><span class="comment"> /*! Given a literal l that is true in the current assignment as a result of</span>
<a name="l00071"></a>00071 <span class="comment"> * an earlier call to getImplication(), this method returns a set of clauses which</span>
<a name="l00072"></a>00072 <span class="comment"> * justifies the propagation of that literal. The clauses will contain the</span>
<a name="l00073"></a>00073 <span class="comment"> * literal l as well as other literals that are in the current assignment.</span>
<a name="l00074"></a>00074 <span class="comment"> * The clauses are such that they would have propagated l via unit</span>
<a name="l00075"></a>00075 <span class="comment"> * propagation at the time getImplication() was called.</span>
<a name="l00076"></a>00076 <span class="comment"> * \param l the literal</span>
<a name="l00077"></a>00077 <span class="comment"> * \param c should be empty initially. */</span>
<a name="l00078"></a>00078 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#ab7a85a15823cb0771d1e9bb4c0ce0703" title="Get an explanation for a literal that was implied.">getExplanation</a>(<a class="code" href="classSAT_1_1Lit.html">Lit</a> l, <a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& c) = 0;
<a name="l00079"></a>00079 <span class="comment"></span>
<a name="l00080"></a>00080 <span class="comment"> //! Get new clauses from the theory.</span>
<a name="l00081"></a>00081 <span class="comment"></span><span class="comment"> /*! This is extended theory learning. Returns false if there are no new</span>
<a name="l00082"></a>00082 <span class="comment"> * clauses to get. Otherwise, returns true and new clauses are added to</span>
<a name="l00083"></a>00083 <span class="comment"> * cnf. Note that the new clauses (if any) are theory lemmas, i.e. clauses</span>
<a name="l00084"></a>00084 <span class="comment"> * that are valid in the theory and not dependent on the current</span>
<a name="l00085"></a>00085 <span class="comment"> * assignment. The clauses may contain new literals as well as literals</span>
<a name="l00086"></a>00086 <span class="comment"> * that are true in the current assignment.</span>
<a name="l00087"></a>00087 <span class="comment"> * \param cnf should be empty initially. */</span>
<a name="l00088"></a>00088 <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html#a7d4bf4b22f7e9f19174a4f2813294acd" title="Get new clauses from the theory.">getNewClauses</a>(<a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& cnf) = 0;
<a name="l00089"></a>00089
<a name="l00090"></a>00090 };
<a name="l00091"></a>00091
<a name="l00092"></a><a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">00092</a> <span class="keyword">class </span><a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">Decider</a> {
<a name="l00093"></a>00093 <span class="keyword">public</span>:
<a name="l00094"></a><a class="code" href="classSAT_1_1DPLLT_1_1Decider.html#ae11de891aaf31257d4d8d391655cd039">00094</a> <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html#ae11de891aaf31257d4d8d391655cd039">Decider</a>() {}
<a name="l00095"></a><a class="code" href="classSAT_1_1DPLLT_1_1Decider.html#a4ce54644af02bd4c93cfd8cb15754cec">00095</a> <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html#a4ce54644af02bd4c93cfd8cb15754cec">~Decider</a>() {}
<a name="l00096"></a>00096 <span class="comment"></span>
<a name="l00097"></a>00097 <span class="comment"> //! Make a decision.</span>
<a name="l00098"></a>00098 <span class="comment"></span> <span class="comment">/* Returns a NULL Lit if there are no more decisions to make */</span>
<a name="l00099"></a>00099 <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1Lit.html">Lit</a> <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html#a9a15df2a6d6fdd38d9719f5681c068f2" title="Make a decision.">makeDecision</a>() = 0;
<a name="l00100"></a>00100
<a name="l00101"></a>00101 };
<a name="l00102"></a>00102
<a name="l00103"></a>00103 <span class="keyword">protected</span>:
<a name="l00104"></a><a class="code" href="classSAT_1_1DPLLT.html#aafa21967afbd30f8c18ebc9f6c37bfa9">00104</a> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html">TheoryAPI</a>* <a class="code" href="classSAT_1_1DPLLT.html#aafa21967afbd30f8c18ebc9f6c37bfa9">d_theoryAPI</a>;
<a name="l00105"></a><a class="code" href="classSAT_1_1DPLLT.html#aebea99801d1e6b690feb9610403f1162">00105</a> <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">Decider</a>* <a class="code" href="classSAT_1_1DPLLT.html#aebea99801d1e6b690feb9610403f1162">d_decider</a>;
<a name="l00106"></a>00106
<a name="l00107"></a>00107 <span class="keyword">public</span>:<span class="comment"></span>
<a name="l00108"></a>00108 <span class="comment"> //! Constructor</span>
<a name="l00109"></a>00109 <span class="comment"></span><span class="comment"> /*! The client constructing DPLLT must provide an implementation of</span>
<a name="l00110"></a>00110 <span class="comment"> * TheoryAPI. It may also optionally provide an implementation of Decider.</span>
<a name="l00111"></a>00111 <span class="comment"> * If decider is NULL, then the DPLLT class must make its own decisions.</span>
<a name="l00112"></a>00112 <span class="comment"> */</span>
<a name="l00113"></a><a class="code" href="classSAT_1_1DPLLT.html#abb3fd219fe5a66e70a70fe33b34b45f5">00113</a> <a class="code" href="classSAT_1_1DPLLT.html#abb3fd219fe5a66e70a70fe33b34b45f5" title="Constructor.">DPLLT</a>(<a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html">TheoryAPI</a>* <a class="code" href="classSAT_1_1DPLLT.html#adec2886c41b3443c264b852bc5f5a84c">theoryAPI</a>, <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">Decider</a>* <a class="code" href="classSAT_1_1DPLLT.html#add78f8065e68c538dd0914949fb87aef">decider</a>)
<a name="l00114"></a>00114 : <a class="code" href="classSAT_1_1DPLLT.html#aafa21967afbd30f8c18ebc9f6c37bfa9">d_theoryAPI</a>(theoryAPI), <a class="code" href="classSAT_1_1DPLLT.html#aebea99801d1e6b690feb9610403f1162">d_decider</a>(decider) {}
<a name="l00115"></a><a class="code" href="classSAT_1_1DPLLT.html#a59bc482fa7ea2517b7dcccbfd5690420">00115</a> <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1DPLLT.html#a59bc482fa7ea2517b7dcccbfd5690420">~DPLLT</a>() {}
<a name="l00116"></a>00116
<a name="l00117"></a><a class="code" href="classSAT_1_1DPLLT.html#adec2886c41b3443c264b852bc5f5a84c">00117</a> <a class="code" href="classSAT_1_1DPLLT_1_1TheoryAPI.html">TheoryAPI</a>* <a class="code" href="classSAT_1_1DPLLT.html#adec2886c41b3443c264b852bc5f5a84c">theoryAPI</a>() { <span class="keywordflow">return</span> <a class="code" href="classSAT_1_1DPLLT.html#aafa21967afbd30f8c18ebc9f6c37bfa9">d_theoryAPI</a>; }
<a name="l00118"></a><a class="code" href="classSAT_1_1DPLLT.html#add78f8065e68c538dd0914949fb87aef">00118</a> <a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">Decider</a>* <a class="code" href="classSAT_1_1DPLLT.html#add78f8065e68c538dd0914949fb87aef">decider</a>() { <span class="keywordflow">return</span> <a class="code" href="classSAT_1_1DPLLT.html#aebea99801d1e6b690feb9610403f1162">d_decider</a>; }
<a name="l00119"></a>00119
<a name="l00120"></a><a class="code" href="classSAT_1_1DPLLT.html#adbf7530318ac373ba6c82983dc4dd595">00120</a> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT.html#adbf7530318ac373ba6c82983dc4dd595">setDecider</a>(<a class="code" href="classSAT_1_1DPLLT_1_1Decider.html">Decider</a>* <a class="code" href="classSAT_1_1DPLLT.html#add78f8065e68c538dd0914949fb87aef">decider</a>) { <a class="code" href="classSAT_1_1DPLLT.html#aebea99801d1e6b690feb9610403f1162">d_decider</a> = <a class="code" href="classSAT_1_1DPLLT.html#add78f8065e68c538dd0914949fb87aef">decider</a>; }
<a name="l00121"></a>00121 <span class="comment"></span>
<a name="l00122"></a>00122 <span class="comment"> //! Set a checkpoint for backtracking</span>
<a name="l00123"></a>00123 <span class="comment"></span><span class="comment"> /*! This should effectively save the current state of the solver. Note that</span>
<a name="l00124"></a>00124 <span class="comment"> * it should also result in a call to TheoryAPI::push.</span>
<a name="l00125"></a>00125 <span class="comment"> */</span>
<a name="l00126"></a>00126 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT.html#aa074d69f0937b579b5f6cfefabadd083" title="Set a checkpoint for backtracking.">push</a>() = 0;
<a name="l00127"></a>00127 <span class="comment"></span>
<a name="l00128"></a>00128 <span class="comment"> //! Restore checkpoint</span>
<a name="l00129"></a>00129 <span class="comment"></span><span class="comment"> /*! This should return the state to what it was immediately before the last</span>
<a name="l00130"></a>00130 <span class="comment"> * call to push. In particular, if one or more calls to checkSat,</span>
<a name="l00131"></a>00131 <span class="comment"> * continueCheck, or addAssertion have been made since the last push, these</span>
<a name="l00132"></a>00132 <span class="comment"> * should be undone. Note also that in this case, a single call to</span>
<a name="l00133"></a>00133 <span class="comment"> * DPLLT::pop may result in multiple calls to TheoryAPI::pop.</span>
<a name="l00134"></a>00134 <span class="comment"> */</span>
<a name="l00135"></a>00135 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT.html#a59925cdeed3751c4fe4b5d759ebd755c" title="Restore checkpoint.">pop</a>() = 0;
<a name="l00136"></a>00136 <span class="comment"></span>
<a name="l00137"></a>00137 <span class="comment"> //! Add new clauses to the SAT solver</span>
<a name="l00138"></a>00138 <span class="comment"></span><span class="comment"> /*! This is used to add clauses that form a "context" for the next call to</span>
<a name="l00139"></a>00139 <span class="comment"> * checkSat</span>
<a name="l00140"></a>00140 <span class="comment"> */</span>
<a name="l00141"></a>00141 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLT.html#aaaa6884de9ebd8b9596e85167e8f9273" title="Add new clauses to the SAT solver.">addAssertion</a>(<span class="keyword">const</span> <a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& cnf) = 0;
<a name="l00142"></a>00142
<a name="l00143"></a>00143 <span class="keyword">virtual</span> std::vector<SAT::Lit> <a class="code" href="classSAT_1_1DPLLT.html#a46312fb7854ac482f28c28564f83494d">getCurAssignments</a>() =0 ;
<a name="l00144"></a>00144 <span class="keyword">virtual</span> std::vector<std::vector<SAT::Lit> > <a class="code" href="classSAT_1_1DPLLT.html#ac73560398ae2ae153d318b53d37c7c71">getCurClauses</a>() =0 ;
<a name="l00145"></a>00145 <span class="comment"></span>
<a name="l00146"></a>00146 <span class="comment"> //! Check the satisfiability of a set of clauses in the current context</span>
<a name="l00147"></a>00147 <span class="comment"></span><span class="comment"> /*! If the result is SATISFIABLE, UNKNOWN, or ABORT, the DPLLT engine should</span>
<a name="l00148"></a>00148 <span class="comment"> * remain in the state it is in until pop() is called. If the result is</span>
<a name="l00149"></a>00149 <span class="comment"> * UNSATISFIABLE, the DPLLT engine should return to the state it was in when</span>
<a name="l00150"></a>00150 <span class="comment"> * called. Note that it should be possible to call checkSat multiple times,</span>
<a name="l00151"></a>00151 <span class="comment"> * even if the result is true (each additional call should use the context</span>
<a name="l00152"></a>00152 <span class="comment"> * left by the previous call).</span>
<a name="l00153"></a>00153 <span class="comment"> */</span>
<a name="l00154"></a>00154 <span class="keyword">virtual</span> <a class="code" href="namespaceCVC3.html#a060d21b3207cc3471e24f8dbcff3498b">CVC3::QueryResult</a> <a class="code" href="classSAT_1_1DPLLT.html#a245df0d49bda0e9bdf69a1153e0d76be" title="Check the satisfiability of a set of clauses in the current context.">checkSat</a>(<span class="keyword">const</span> <a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& cnf) = 0;
<a name="l00155"></a>00155 <span class="comment"></span>
<a name="l00156"></a>00156 <span class="comment"> //! Continue checking the last check with additional constraints</span>
<a name="l00157"></a>00157 <span class="comment"></span><span class="comment"> /*! Should only be called after a previous call to checkSat (or</span>
<a name="l00158"></a>00158 <span class="comment"> * continueCheck) that returned SATISFIABLE. It should add the clauses in</span>
<a name="l00159"></a>00159 <span class="comment"> * cnf to the existing clause database and search for a satisfying</span>
<a name="l00160"></a>00160 <span class="comment"> * assignment. As with checkSat, if the result is not UNSATISFIABLE, the</span>
<a name="l00161"></a>00161 <span class="comment"> * DPLLT engine should remain in the state containing the satisfiable</span>
<a name="l00162"></a>00162 <span class="comment"> * assignment until pop() is called. Similarly, if the result is</span>
<a name="l00163"></a>00163 <span class="comment"> * UNSATISFIABLE, the DPLLT engine should return to the state it was in when</span>
<a name="l00164"></a>00164 <span class="comment"> * checkSat was last called.</span>
<a name="l00165"></a>00165 <span class="comment"> */</span>
<a name="l00166"></a>00166 <span class="keyword">virtual</span> <a class="code" href="namespaceCVC3.html#a060d21b3207cc3471e24f8dbcff3498b">CVC3::QueryResult</a> <a class="code" href="classSAT_1_1DPLLT.html#a713db9fe798e2a9be337b8726540a24e" title="Continue checking the last check with additional constraints.">continueCheck</a>(<span class="keyword">const</span> <a class="code" href="classSAT_1_1CNF__Formula.html">CNF_Formula</a>& cnf) = 0;
<a name="l00167"></a>00167 <span class="comment"></span>
<a name="l00168"></a>00168 <span class="comment"> //! Get value of variable: unassigned, false, or true</span>
<a name="l00169"></a>00169 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1Var.html#ac9cf10f19f5f4d86ad539777fd8ca5ae">Var::Val</a> <a class="code" href="classSAT_1_1DPLLT.html#a961364ed0ea77af61dbabd7a3a07670c" title="Get value of variable: unassigned, false, or true.">getValue</a>(<a class="code" href="classSAT_1_1Var.html">Var</a> v) = 0;
<a name="l00170"></a>00170 <span class="comment"></span>
<a name="l00171"></a>00171 <span class="comment"> //! Get the proof from SAT engine. </span>
<a name="l00172"></a>00172 <span class="comment"></span> <span class="keyword">virtual</span> <a class="code" href="classCVC3_1_1Proof.html">CVC3::Proof</a> <a class="code" href="classSAT_1_1DPLLT.html#ada559a7b19d3dfe82acfa084b8b634ad" title="Get the proof from SAT engine.">getSatProof</a>(<a class="code" href="classSAT_1_1CNF__Manager.html">CNF_Manager</a>*, <a class="code" href="classCVC3_1_1TheoryCore.html" title="This theory handles the built-in logical connectives plus equality. It also handles the registration ...">CVC3::TheoryCore</a>*) = 0 ;
<a name="l00173"></a>00173
<a name="l00174"></a>00174 };
<a name="l00175"></a>00175
<a name="l00176"></a>00176 }
<a name="l00177"></a>00177
<a name="l00178"></a>00178 <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>
