<!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_minisat.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_minisat.h</div> </div>
</div>
<div class="contents">
<a href="dpllt__minisat_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_minisat.h</span>
<a name="l00004"></a>00004 <span class="comment"> *\brief Implementation of dpllt module based on minisat</span>
<a name="l00005"></a>00005 <span class="comment"> *</span>
<a name="l00006"></a>00006 <span class="comment"> * Author: Alexander Fuchs</span>
<a name="l00007"></a>00007 <span class="comment"> *</span>
<a name="l00008"></a>00008 <span class="comment"> * Created: Fri Sep 08 11:04:00 2006</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
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef _cvc3__sat__dpllt_minisat_h_</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define _cvc3__sat__dpllt_minisat_h_</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "<a class="code" href="dpllt_8h.html" title="Generic DPLL(T) module.">dpllt.h</a>"</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "<a class="code" href="proof_8h.html">proof.h</a>"</span>
<a name="l00026"></a>00026 <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="l00027"></a>00027 <span class="preprocessor">#include <stack></span>
<a name="l00028"></a>00028
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="comment">// forward declaration of the minisat solver</span>
<a name="l00031"></a><a class="code" href="namespaceMiniSat.html">00031</a> <span class="keyword">namespace </span>MiniSat {
<a name="l00032"></a>00032 <span class="keyword">class </span><a class="code" href="classMiniSat_1_1Solver.html">Solver</a>;
<a name="l00033"></a>00033 }
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="keyword">namespace </span>SAT {
<a name="l00036"></a>00036
<a name="l00037"></a>00037 <span class="keyword">class </span>SatProof;
<a name="l00038"></a>00038
<a name="l00039"></a>00039 <span class="comment">// an implementation of the DPLLT interface using an adapted MiniSat SAT solver</span>
<a name="l00040"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html">00040</a> <span class="keyword">class </span><a class="code" href="classSAT_1_1DPLLTMiniSat.html">DPLLTMiniSat</a> : <span class="keyword">public</span> <a class="code" href="classSAT_1_1DPLLT.html">DPLLT</a> {
<a name="l00041"></a>00041 <span class="keyword">public</span>:
<a name="l00042"></a>00042
<a name="l00043"></a>00043 <span class="keyword">protected</span>:
<a name="l00044"></a>00044 <span class="comment">// determines if the derivation statistic of the solver</span>
<a name="l00045"></a>00045 <span class="comment">// is printed after the derivation terminates.</span>
<a name="l00046"></a>00046 <span class="comment">// can only be set with the constructor</span>
<a name="l00047"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html#afa6ba4582477c902c7eb4d498c42882e">00047</a> <span class="keywordtype">bool</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#afa6ba4582477c902c7eb4d498c42882e">d_printStats</a>;
<a name="l00048"></a>00048
<a name="l00049"></a>00049 <span class="comment">// if true then minisat will create a derivation</span>
<a name="l00050"></a>00050 <span class="comment">// of the empty clause for an unsatisfiable problem.</span>
<a name="l00051"></a>00051 <span class="comment">// see getProof().</span>
<a name="l00052"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html#ac6230604f45056b39c0869f05fe0ae7e">00052</a> <span class="keywordtype">bool</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#ac6230604f45056b39c0869f05fe0ae7e">d_createProof</a>;
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="comment">// if d_createProof, then the proof of the last unsatisfiable search</span>
<a name="l00055"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html#a9eb24ce4c4b1a9f1dae868b18017f905">00055</a> <a class="code" href="classSAT_1_1SatProof.html">SatProof</a>* <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a9eb24ce4c4b1a9f1dae868b18017f905">d_proof</a>;
<a name="l00056"></a>00056
<a name="l00057"></a>00057 <span class="comment">// the dpllt interface operates in a stack fashion via checkSat and push.</span>
<a name="l00058"></a>00058 <span class="comment">// each stack's data is stored in a level, which is just an instance of MiniSat.</span>
<a name="l00059"></a>00059 <span class="comment">// whenever a checkSat or push is done on a solver that is already in a search,</span>
<a name="l00060"></a>00060 <span class="comment">// a new solver is created and pushed.</span>
<a name="l00061"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html#a36d133e42dbd9557434a166d1e97d050">00061</a> std::stack<MiniSat::Solver*> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a36d133e42dbd9557434a166d1e97d050">d_solvers</a>;
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="comment">// returnes the currently active MiniSat instance</span>
<a name="l00064"></a>00064 <span class="comment">//</span>
<a name="l00065"></a>00065 <span class="comment">// must not be called when there is no active MiniSat instance,</span>
<a name="l00066"></a>00066 <span class="comment">// i.e. d_solvers is empty.</span>
<a name="l00067"></a>00067 <a class="code" href="classMiniSat_1_1Solver.html">MiniSat::Solver</a>* <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a19b4d9e00382a6b386ac51461f156785">getActiveSolver</a>();
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">// creates a solver as an extension of the previous solver</span>
<a name="l00070"></a>00070 <span class="comment">// (i.e. takes clauses/assignments/lemmas)</span>
<a name="l00071"></a>00071 <span class="comment">// and pushes it on d_solvers</span>
<a name="l00072"></a>00072 <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a2ee2582067c44520f4554de44ebec16a">pushSolver</a>();
<a name="l00073"></a>00073
<a name="l00074"></a>00074 <span class="comment">// called by checkSat and continueCheck to initiate a search</span>
<a name="l00075"></a>00075 <span class="comment">// with a SAT solver</span>
<a name="l00076"></a>00076 <a class="code" href="namespaceCVC3.html#a060d21b3207cc3471e24f8dbcff3498b">CVC3::QueryResult</a> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a30d61595534052f920440688f5cec73b">search</a>();
<a name="l00077"></a>00077
<a name="l00078"></a>00078
<a name="l00079"></a>00079
<a name="l00080"></a>00080 <span class="keyword">public</span>:
<a name="l00081"></a>00081 <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a8845ef99231d4f4096f0254423aca649">DPLLTMiniSat</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="l00082"></a>00082 <span class="keywordtype">bool</span> printStats = <span class="keyword">false</span>, <span class="keywordtype">bool</span> createProof = <span class="keyword">false</span>);
<a name="l00083"></a>00083 <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#ad95c622192084c6fb35d4a944b02a41f">~DPLLTMiniSat</a>();
<a name="l00084"></a>00084
<a name="l00085"></a>00085
<a name="l00086"></a>00086 <span class="comment">// Implementation of the DPLLT interface</span>
<a name="l00087"></a>00087 <span class="keyword">virtual</span> <a class="code" href="namespaceCVC3.html#a060d21b3207cc3471e24f8dbcff3498b">CVC3::QueryResult</a> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a51a36acb7b2ed49d97fa8d5524604604" 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);
<a name="l00088"></a>00088 <span class="keyword">virtual</span> <a class="code" href="namespaceCVC3.html#a060d21b3207cc3471e24f8dbcff3498b">CVC3::QueryResult</a> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#aae7502914c5ca0708d0bd11ebc766d0a" 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);
<a name="l00089"></a>00089 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a169decc11aac46183d6213a2c6f12633" title="Set a checkpoint for backtracking.">push</a>();
<a name="l00090"></a>00090 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a6cf0c23d330fc8609323cb3dd8282377" title="Restore checkpoint.">pop</a>();
<a name="l00091"></a>00091 <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#afdf7f3a5aa5eccf6c04ba4326567f0b9" 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);
<a name="l00092"></a>00092 <span class="keyword">virtual</span> std::vector<SAT::Lit> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#aae30c40897ec35d1a0485899865b723e">getCurAssignments</a>() ;
<a name="l00093"></a>00093 <span class="keyword">virtual</span> std::vector<std::vector<SAT::Lit> > <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a1a19b6494dbc9bdd404e5917ee9eea24">getCurClauses</a>();
<a name="l00094"></a>00094 <span class="keyword">virtual</span> <a class="code" href="classSAT_1_1Var.html#ac9cf10f19f5f4d86ad539777fd8ca5ae">Var::Val</a> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a06fd86d63383adc68d1ace6deb466175" title="Get value of variable: unassigned, false, or true.">getValue</a>(<a class="code" href="classSAT_1_1Var.html">Var</a> v);
<a name="l00095"></a>00095
<a name="l00096"></a>00096 <span class="comment">// if createProof was given returns a proof of the last unsatisfiable search,</span>
<a name="l00097"></a>00097 <span class="comment">// otherwise (or if there was no unsatisfiable search) NULL</span>
<a name="l00098"></a>00098 <span class="comment">// ownership remains with DPLLTMiniSat</span>
<a name="l00099"></a><a class="code" href="classSAT_1_1DPLLTMiniSat.html#a679c7d58efef6a952128669e7fb7e493">00099</a> <a class="code" href="classSAT_1_1SatProof.html">SatProof</a>* <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a679c7d58efef6a952128669e7fb7e493">getProof</a>() {
<a name="l00100"></a>00100 <a class="code" href="debug_8h.html#a40dac3bdb2166ffc852ee8b1489d2b56">DebugAssert</a>((<a class="code" href="classSAT_1_1DPLLTMiniSat.html#a9eb24ce4c4b1a9f1dae868b18017f905">d_proof</a> != NULL), <span class="stringliteral">"null proof foound"</span>) ;
<a name="l00101"></a>00101 <span class="keywordflow">return</span> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#a9eb24ce4c4b1a9f1dae868b18017f905">d_proof</a>;
<a name="l00102"></a>00102 };
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <a class="code" href="classCVC3_1_1Proof.html">CVC3::Proof</a> <a class="code" href="classSAT_1_1DPLLTMiniSat.html#ae465fc059c93948333a16b2c21a8828b" 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>*) ;
<a name="l00105"></a>00105 };
<a name="l00106"></a>00106
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <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>
