619 lines
110 KiB
HTML
619 lines
110 KiB
HTML
<!-- HTML header for doxygen 1.8.18-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://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"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.3"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>OR-Tools: simplification.h Source File</title>
|
|
<link href="tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="jquery.js"></script>
|
|
<script type="text/javascript" src="dynsections.js"></script>
|
|
<link href="navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="resize.js"></script>
|
|
<script type="text/javascript" src="navtreedata.js"></script>
|
|
<script type="text/javascript" src="navtree.js"></script>
|
|
<link href="search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="search/searchdata.js"></script>
|
|
<script type="text/javascript" src="search/search.js"></script>
|
|
<link href="doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="styleSheet.tmp.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr style="height: 56px;">
|
|
<td id="projectlogo"><img alt="Logo" src="orLogo.png"/></td>
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">OR-Tools
|
|
 <span id="projectnumber">9.3</span>
|
|
</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.9.3 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
var searchBox = new SearchBox("searchBox", "search",'Search','.html');
|
|
/* @license-end */
|
|
</script>
|
|
<script type="text/javascript" src="menudata.js"></script>
|
|
<script type="text/javascript" src="menu.js"></script>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(function() {
|
|
initMenu('',true,false,'search.php','Search');
|
|
$(document).ready(function() { init_search(); });
|
|
});
|
|
/* @license-end */
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
|
$(document).ready(function(){initNavTree('simplification_8h_source.html',''); initResizable(); });
|
|
/* @license-end */
|
|
</script>
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<iframe src="javascript:void(0)" frameborder="0"
|
|
name="MSearchResults" id="MSearchResults">
|
|
</iframe>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<div class="headertitle"><div class="title">simplification.h</div></div>
|
|
</div><!--header-->
|
|
<div class="contents">
|
|
<a href="simplification_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span><span class="comment">// Copyright 2010-2021 Google LLC</span></div>
|
|
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno"> 2</span><span class="comment">// Licensed under the Apache License, Version 2.0 (the "License");</span></div>
|
|
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno"> 3</span><span class="comment">// you may not use this file except in compliance with the License.</span></div>
|
|
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno"> 4</span><span class="comment">// You may obtain a copy of the License at</span></div>
|
|
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno"> 5</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno"> 6</span><span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div>
|
|
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="comment">// Unless required by applicable law or agreed to in writing, software</span></div>
|
|
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="comment">// distributed under the License is distributed on an "AS IS" BASIS,</span></div>
|
|
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.</span></div>
|
|
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="comment">// See the License for the specific language governing permissions and</span></div>
|
|
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="comment">// limitations under the License.</span></div>
|
|
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
|
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span><span class="comment">// Implementation of a pure SAT presolver. This roughly follows the paper:</span></div>
|
|
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span><span class="comment">// "Effective Preprocessing in SAT through Variable and Clause Elimination",</span></div>
|
|
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"> 17</span><span class="comment">// Niklas Een and Armin Biere, published in the SAT 2005 proceedings.</span></div>
|
|
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> </div>
|
|
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="preprocessor">#ifndef OR_TOOLS_SAT_SIMPLIFICATION_H_</span></div>
|
|
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span><span class="preprocessor">#define OR_TOOLS_SAT_SIMPLIFICATION_H_</span></div>
|
|
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> </div>
|
|
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span><span class="preprocessor">#include <cstdint></span></div>
|
|
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><span class="preprocessor">#include <deque></span></div>
|
|
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <memory></span></div>
|
|
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="preprocessor">#include <utility></span></div>
|
|
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span><span class="preprocessor">#include <vector></span></div>
|
|
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> </div>
|
|
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span><span class="preprocessor">#include "absl/container/btree_set.h"</span></div>
|
|
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="preprocessor">#include "absl/types/span.h"</span></div>
|
|
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span><span class="preprocessor">#include "<a class="code" href="adjustable__priority__queue_8h.html">ortools/base/adjustable_priority_queue.h</a>"</span></div>
|
|
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span><span class="preprocessor">#include "<a class="code" href="integral__types_8h.html">ortools/base/integral_types.h</a>"</span></div>
|
|
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span><span class="preprocessor">#include "<a class="code" href="macros_8h.html">ortools/base/macros.h</a>"</span></div>
|
|
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span><span class="preprocessor">#include "<a class="code" href="strong__vector_8h.html">ortools/base/strong_vector.h</a>"</span></div>
|
|
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span><span class="preprocessor">#include "<a class="code" href="drat__proof__handler_8h.html">ortools/sat/drat_proof_handler.h</a>"</span></div>
|
|
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span><span class="preprocessor">#include "<a class="code" href="sat__base_8h.html">ortools/sat/sat_base.h</a>"</span></div>
|
|
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span><span class="preprocessor">#include "ortools/sat/sat_parameters.pb.h"</span></div>
|
|
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span><span class="preprocessor">#include "<a class="code" href="sat__solver_8h.html">ortools/sat/sat_solver.h</a>"</span></div>
|
|
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span><span class="preprocessor">#include "<a class="code" href="util_2logging_8h.html">ortools/util/logging.h</a>"</span></div>
|
|
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span><span class="preprocessor">#include "<a class="code" href="strong__integers_8h.html">ortools/util/strong_integers.h</a>"</span></div>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span><span class="preprocessor">#include "<a class="code" href="time__limit_8h.html">ortools/util/time_limit.h</a>"</span></div>
|
|
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
|
|
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span><span class="keyword">namespace </span><a class="code hl_namespace" href="namespaceoperations__research.html">operations_research</a> {</div>
|
|
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span><span class="keyword">namespace </span>sat {</div>
|
|
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> </div>
|
|
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span><span class="comment">// A simple sat postsolver.</span></div>
|
|
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span><span class="comment">// The idea is that any presolve algorithm can just update this class, and at</span></div>
|
|
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span><span class="comment">// the end, this class will recover a solution of the initial problem from a</span></div>
|
|
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span><span class="comment">// solution of the presolved problem.</span></div>
|
|
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_postsolver.html"> 50</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_postsolver.html">SatPostsolver</a> {</div>
|
|
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a3b174af81ff48a2cf33d23179125b356">SatPostsolver</a>(<span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
|
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="comment">// The postsolver will process the Add() calls in reverse order. If the given</span></div>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="comment">// clause has all its literals at false, it simply sets the literal x to true.</span></div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="comment">// Note that x must be a literal of the given clause.</span></div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a024e94c6e22e2fe747bb4355b52a8eab">Add</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> x, <span class="keyword">const</span> absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> </div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="comment">// Tells the postsolver that the given literal must be true in any solution.</span></div>
|
|
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="comment">// We currently check that the variable is not already fixed.</span></div>
|
|
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="comment">// TODO(user): this as almost the same effect as adding an unit clause, and we</span></div>
|
|
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="comment">// should probably remove this to simplify the code.</span></div>
|
|
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a40432775821777983c4df6b4f2a71d92">FixVariable</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> x);</div>
|
|
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> </div>
|
|
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> <span class="comment">// This assumes that the given variable mapping has been applied to the</span></div>
|
|
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// problem. All the subsequent Add() and FixVariable() will refer to the new</span></div>
|
|
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="comment">// problem. During postsolve, the initial solution must also correspond to</span></div>
|
|
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="comment">// this new problem. Note that if mapping[v] == -1, then the literal v is</span></div>
|
|
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> <span class="comment">// assumed to be deleted.</span></div>
|
|
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="comment">// This can be called more than once. But each call must refer to the current</span></div>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="comment">// variables set (after all the previous mapping have been applied).</span></div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a8155216960c6e1f5d476e1c28b2d34fa">ApplyMapping</a>(</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, BooleanVariable></a>& mapping);</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> </div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> <span class="comment">// Extracts the current assignment of the given solver and postsolve it.</span></div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> <span class="comment">// Node(fdid): This can currently be called only once (but this is easy to</span></div>
|
|
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="comment">// change since only some CHECK will fail).</span></div>
|
|
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> std::vector<bool> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#ac6f385a340d67f08c9f3d8e686ebf571">ExtractAndPostsolveSolution</a>(<span class="keyword">const</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>& solver);</div>
|
|
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> std::vector<bool> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a8995563af871eb8c2b05bf99bd89344a">PostsolveSolution</a>(<span class="keyword">const</span> std::vector<bool>& solution);</div>
|
|
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> </div>
|
|
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="comment">// Getters to the clauses managed by this class.</span></div>
|
|
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> <span class="comment">// Important: This will always put the associated literal first.</span></div>
|
|
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a235d38393e2379eb6a016446341d2102"> 86</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a235d38393e2379eb6a016446341d2102">NumClauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> clauses_start_.size(); }</div>
|
|
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#aa6e59b763fa9265e1a3487de47d5fddc"> 87</a></span> std::vector<Literal> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_postsolver.html#aa6e59b763fa9265e1a3487de47d5fddc">Clause</a>(<span class="keywordtype">int</span> i)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> <span class="comment">// TODO(user): we could avoid the copy here, but because clauses_literals_</span></div>
|
|
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="comment">// is a deque, we do need a special return class and cannot juste use</span></div>
|
|
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="comment">// absl::Span<Literal> for instance.</span></div>
|
|
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keyword">const</span> <span class="keywordtype">int</span> begin = clauses_start_[i];</div>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">const</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a> = i + 1 < clauses_start_.size() ? clauses_start_[i + 1]</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> : clauses_literals_.size();</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::vector<Literal> result(clauses_literals_.begin() + begin,</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> clauses_literals_.begin() + <a class="code hl_variable" href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a>);</div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j < result.size(); ++j) {</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (result[j] == associated_literal_[i]) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_function" href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">std::swap</a>(result[0], result[j]);</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">break</span>;</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> }</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> }</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> }</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> </div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> ApplyReverseMapping(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> l);</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordtype">void</span> Postsolve(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a>* assignment) <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// The presolve can add new variables, so we need to store the number of</span></div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="comment">// original variables in order to return a solution with the correct number</span></div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> <span class="comment">// of variables.</span></div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">const</span> <span class="keywordtype">int</span> initial_num_variables_;</div>
|
|
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> <span class="keywordtype">int</span> num_variables_;</div>
|
|
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> </div>
|
|
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="comment">// Stores the arguments of the Add() calls: clauses_start_[i] is the index of</span></div>
|
|
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> <span class="comment">// the first literal of the clause #i in the clauses_literals_ deque.</span></div>
|
|
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span> std::vector<int> clauses_start_;</div>
|
|
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> std::deque<Literal> clauses_literals_;</div>
|
|
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> std::vector<Literal> associated_literal_;</div>
|
|
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> </div>
|
|
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> <span class="comment">// All the added clauses will be mapped back to the initial variables using</span></div>
|
|
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// this reverse mapping. This way, clauses_ and associated_literal_ are only</span></div>
|
|
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// in term of the initial problem.</span></div>
|
|
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, BooleanVariable></a> reverse_mapping_;</div>
|
|
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> </div>
|
|
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="comment">// This will stores the fixed variables value and later the postsolved</span></div>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="comment">// assignment.</span></div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_variables_assignment.html">VariablesAssignment</a> assignment_;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> </div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> DISALLOW_COPY_AND_ASSIGN(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_postsolver.html">SatPostsolver</a>);</div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span>};</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> </div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span><span class="comment">// This class holds a SAT problem (i.e. a set of clauses) and the logic to</span></div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span><span class="comment">// presolve it by a series of subsumption, self-subsuming resolution, and</span></div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span><span class="comment">// variable elimination by clause distribution.</span></div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span><span class="comment">// Note that this does propagate unit-clauses, but probably much</span></div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span><span class="comment">// less efficiently than the propagation code in the SAT solver. So it is better</span></div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span><span class="comment">// to use a SAT solver to fix variables before using this class.</span></div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span><span class="comment">// TODO(user): Interact more with a SAT solver to reuse its propagation logic.</span></div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span><span class="comment">// TODO(user): Forbid the removal of some variables. This way we can presolve</span></div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span><span class="comment">// only the clause part of a general Boolean problem by not removing variables</span></div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span><span class="comment">// appearing in pseudo-Boolean constraints.</span></div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html"> 146</a></span><span class="keyword">class </span><a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_presolver.html">SatPresolver</a> {</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keyword">public</span>:</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="comment">// TODO(user): use IntType!</span></div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7"> 149</a></span> <span class="keyword">typedef</span> int32_t <a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a>;</div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> </div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a270327e7a3140c8373299ba9d27cd99a"> 151</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a270327e7a3140c8373299ba9d27cd99a">SatPresolver</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_postsolver.html">SatPostsolver</a>* postsolver, <a class="code hl_class" href="classoperations__research_1_1_solver_logger.html">SolverLogger</a>* logger)</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> : postsolver_(postsolver),</div>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> num_trivial_clauses_(0),</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> drat_proof_handler_(nullptr),</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> logger_(logger) {}</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> </div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a687eb5f7ae0e0268094f954adff08d8d"> 157</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a687eb5f7ae0e0268094f954adff08d8d">SetParameters</a>(<span class="keyword">const</span> SatParameters& params) { parameters_ = params; }</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#ad99bfbfbdeb3354d3694aecd7fda6deb"> 158</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#ad99bfbfbdeb3354d3694aecd7fda6deb">SetTimeLimit</a>(<a class="code hl_class" href="classoperations__research_1_1_time_limit.html">TimeLimit</a>* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>) { time_limit_ = <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>; }</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="comment">// Registers a mapping to encode equivalent literals.</span></div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="comment">// See ProbeAndFindEquivalentLiteral().</span></div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a3f9bc2c396e3354ce7a6cf09427474a8"> 162</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a3f9bc2c396e3354ce7a6cf09427474a8">SetEquivalentLiteralMapping</a>(</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keyword">const</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, LiteralIndex></a>& mapping) {</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> equiv_mapping_ = mapping;</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> }</div>
|
|
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> </div>
|
|
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="comment">// Adds new clause to the SatPresolver.</span></div>
|
|
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a0b58ef3a397720b272662f8bc45585cb">SetNumVariables</a>(<span class="keywordtype">int</span> num_variables);</div>
|
|
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a26fc07b3630b79be6914e6387b63a073">AddBinaryClause</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a98bacf41c50979896b4a5f5e41fb0ccf">AddClause</a>(absl::Span<const Literal> clause);</div>
|
|
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> </div>
|
|
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> <span class="comment">// Presolves the problem currently loaded. Returns false if the model is</span></div>
|
|
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="comment">// proven to be UNSAT during the presolving.</span></div>
|
|
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00175" name="l00175"></a><span class="lineno"> 175</span> <span class="comment">// TODO(user): Add support for a time limit and some kind of iterations limit</span></div>
|
|
<div class="line"><a id="l00176" name="l00176"></a><span class="lineno"> 176</span> <span class="comment">// so that this can never take too much time.</span></div>
|
|
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"> 177</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a4357280dffaba15fcb7f932afe0aea3f">Presolve</a>();</div>
|
|
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> </div>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="comment">// Same as Presolve() but only allow to remove BooleanVariable whose index</span></div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> <span class="comment">// is set to true in the given vector.</span></div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a4357280dffaba15fcb7f932afe0aea3f">Presolve</a>(<span class="keyword">const</span> std::vector<bool>& var_that_can_be_removed);</div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> </div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="comment">// All the clauses managed by this class.</span></div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// Note that deleted clauses keep their indices (they are just empty).</span></div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a235d38393e2379eb6a016446341d2102"> 185</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a235d38393e2379eb6a016446341d2102">NumClauses</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> clauses_.size(); }</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a0ccb7f8f94de0435ec83e71d52b61511"> 186</a></span> <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a0ccb7f8f94de0435ec83e71d52b61511">Clause</a>(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> ci)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">return</span> clauses_[ci];</div>
|
|
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
|
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> </div>
|
|
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> <span class="comment">// The number of variables. This is computed automatically from the clauses</span></div>
|
|
<div class="line"><a id="l00191" name="l00191"></a><span class="lineno"> 191</span> <span class="comment">// added to the SatPresolver.</span></div>
|
|
<div class="line"><a id="l00192" name="l00192"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a9d3beb2afe4ae647674b054bf29290e2"> 192</a></span> <span class="keywordtype">int</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a9d3beb2afe4ae647674b054bf29290e2">NumVariables</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> literal_to_clause_sizes_.<a class="code hl_function" href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">size</a>() / 2; }</div>
|
|
<div class="line"><a id="l00193" name="l00193"></a><span class="lineno"> 193</span> </div>
|
|
<div class="line"><a id="l00194" name="l00194"></a><span class="lineno"> 194</span> <span class="comment">// After presolving, Some variables in [0, NumVariables()) have no longer any</span></div>
|
|
<div class="line"><a id="l00195" name="l00195"></a><span class="lineno"> 195</span> <span class="comment">// clause pointing to them. This return a mapping that maps this interval to</span></div>
|
|
<div class="line"><a id="l00196" name="l00196"></a><span class="lineno"> 196</span> <span class="comment">// [0, new_size) such that now all variables are used. The unused variable</span></div>
|
|
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"> 197</span> <span class="comment">// will be mapped to BooleanVariable(-1).</span></div>
|
|
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, BooleanVariable></a> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a69b55d318122f02f0fb03fb1c070ab37">VariableMapping</a>() <span class="keyword">const</span>;</div>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> </div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="comment">// Loads the current presolved problem in to the given sat solver.</span></div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> <span class="comment">// Note that the variables will be re-indexed according to the mapping given</span></div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> <span class="comment">// by GetMapping() so that they form a dense set.</span></div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// IMPORTANT: This is not const because it deletes the presolver clauses as</span></div>
|
|
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// they are added to the SatSolver in order to save memory. After this is</span></div>
|
|
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// called, only VariableMapping() will still works.</span></div>
|
|
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a11c34313bd8d2e6ac75054fd4bc51a8a">LoadProblemIntoSatSolver</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_sat_solver.html">SatSolver</a>* solver);</div>
|
|
<div class="line"><a id="l00208" name="l00208"></a><span class="lineno"> 208</span> </div>
|
|
<div class="line"><a id="l00209" name="l00209"></a><span class="lineno"> 209</span> <span class="comment">// Visible for Testing. Takes a given clause index and looks for clause that</span></div>
|
|
<div class="line"><a id="l00210" name="l00210"></a><span class="lineno"> 210</span> <span class="comment">// can be subsumed or strengthened using this clause. Returns false if the</span></div>
|
|
<div class="line"><a id="l00211" name="l00211"></a><span class="lineno"> 211</span> <span class="comment">// model is proven to be unsat.</span></div>
|
|
<div class="line"><a id="l00212" name="l00212"></a><span class="lineno"> 212</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#ac36d4cd02bbf1501a134d61fc510ad68">ProcessClauseToSimplifyOthers</a>(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> clause_index);</div>
|
|
<div class="line"><a id="l00213" name="l00213"></a><span class="lineno"> 213</span> </div>
|
|
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"> 214</span> <span class="comment">// Visible for testing. Tries to eliminate x by clause distribution.</span></div>
|
|
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// This is also known as bounded variable elimination.</span></div>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="comment">// It is always possible to remove x by resolving each clause containing x</span></div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> <span class="comment">// with all the clauses containing not(x). Hence the cross-product name. Note</span></div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> <span class="comment">// that this function only do that if the number of clauses is reduced.</span></div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#ae39cbe1919d9200f3f41cf96b7eee703">CrossProduct</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> x);</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</span> </div>
|
|
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <span class="comment">// Visible for testing. Just applies the BVA step of the presolve.</span></div>
|
|
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a5ddcb2924990b8dbcf375f7c19846218">PresolveWithBva</a>();</div>
|
|
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
|
<div class="line"><a id="l00225" name="l00225"></a><span class="lineno"><a class="line" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a75f1d17f36330a1c8a96e43fe8805598"> 225</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a75f1d17f36330a1c8a96e43fe8805598">SetDratProofHandler</a>(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">DratProofHandler</a>* drat_proof_handler) {</div>
|
|
<div class="line"><a id="l00226" name="l00226"></a><span class="lineno"> 226</span> drat_proof_handler_ = drat_proof_handler;</div>
|
|
<div class="line"><a id="l00227" name="l00227"></a><span class="lineno"> 227</span> }</div>
|
|
<div class="line"><a id="l00228" name="l00228"></a><span class="lineno"> 228</span> </div>
|
|
<div class="line"><a id="l00229" name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">private</span>:</div>
|
|
<div class="line"><a id="l00230" name="l00230"></a><span class="lineno"> 230</span> <span class="comment">// Internal function used by ProcessClauseToSimplifyOthers().</span></div>
|
|
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"> 231</span> <span class="keywordtype">bool</span> ProcessClauseToSimplifyOthersUsingLiteral(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> clause_index,</div>
|
|
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> lit);</div>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> </div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="comment">// Internal function to add clauses generated during the presolve. The clause</span></div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> <span class="comment">// must already be sorted with the default Literal order and will be cleared</span></div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> <span class="comment">// after this call.</span></div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <span class="keywordtype">void</span> AddClauseInternal(std::vector<Literal>* clause);</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> </div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Clause removal function.</span></div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> <span class="keywordtype">void</span> Remove(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> ci);</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> <span class="keywordtype">void</span> RemoveAndRegisterForPostsolve(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> ci, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> x);</div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keywordtype">void</span> RemoveAndRegisterForPostsolveAllClauseContaining(<a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> x);</div>
|
|
<div class="line"><a id="l00243" name="l00243"></a><span class="lineno"> 243</span> </div>
|
|
<div class="line"><a id="l00244" name="l00244"></a><span class="lineno"> 244</span> <span class="comment">// Call ProcessClauseToSimplifyOthers() on all the clauses in</span></div>
|
|
<div class="line"><a id="l00245" name="l00245"></a><span class="lineno"> 245</span> <span class="comment">// clause_to_process_ and empty the list afterwards. Note that while some</span></div>
|
|
<div class="line"><a id="l00246" name="l00246"></a><span class="lineno"> 246</span> <span class="comment">// clauses are processed, new ones may be added to the list. Returns false if</span></div>
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// the problem is shown to be UNSAT.</span></div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><span class="lineno"> 248</span> <span class="keywordtype">bool</span> ProcessAllClauses();</div>
|
|
<div class="line"><a id="l00249" name="l00249"></a><span class="lineno"> 249</span> </div>
|
|
<div class="line"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> <span class="comment">// Finds the literal from the clause that occur the less in the clause</span></div>
|
|
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> <span class="comment">// database.</span></div>
|
|
<div class="line"><a id="l00252" name="l00252"></a><span class="lineno"> 252</span> <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> FindLiteralWithShortestOccurrenceList(</div>
|
|
<div class="line"><a id="l00253" name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">const</span> std::vector<Literal>& clause);</div>
|
|
<div class="line"><a id="l00254" name="l00254"></a><span class="lineno"> 254</span> LiteralIndex FindLiteralWithShortestOccurrenceListExcluding(</div>
|
|
<div class="line"><a id="l00255" name="l00255"></a><span class="lineno"> 255</span> <span class="keyword">const</span> std::vector<Literal>& clause, <a class="code hl_class" href="classoperations__research_1_1sat_1_1_literal.html">Literal</a> to_exclude);</div>
|
|
<div class="line"><a id="l00256" name="l00256"></a><span class="lineno"> 256</span> </div>
|
|
<div class="line"><a id="l00257" name="l00257"></a><span class="lineno"> 257</span> <span class="comment">// Tests and maybe perform a Simple Bounded Variable addition starting from</span></div>
|
|
<div class="line"><a id="l00258" name="l00258"></a><span class="lineno"> 258</span> <span class="comment">// the given literal as described in the paper: "Automated Reencoding of</span></div>
|
|
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"> 259</span> <span class="comment">// Boolean Formulas", Norbert Manthey, Marijn J. H. Heule, and Armin Biere,</span></div>
|
|
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="comment">// Volume 7857 of the series Lecture Notes in Computer Science pp 102-117,</span></div>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="comment">// 2013.</span></div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// https://www.research.ibm.com/haifa/conferences/hvc2012/papers/paper16.pdf</span></div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> <span class="comment">//</span></div>
|
|
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// This seems to have a mostly positive effect, except on the crafted problem</span></div>
|
|
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// familly mugrauer_balint--GI.crafted_nxx_d6_cx_numxx where the reduction</span></div>
|
|
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// is big, but apparently the problem is harder to prove UNSAT for the solver.</span></div>
|
|
<div class="line"><a id="l00267" name="l00267"></a><span class="lineno"> 267</span> <span class="keywordtype">void</span> SimpleBva(LiteralIndex l);</div>
|
|
<div class="line"><a id="l00268" name="l00268"></a><span class="lineno"> 268</span> </div>
|
|
<div class="line"><a id="l00269" name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// Display some statistics on the current clause database.</span></div>
|
|
<div class="line"><a id="l00270" name="l00270"></a><span class="lineno"> 270</span> <span class="keywordtype">void</span> DisplayStats(<span class="keywordtype">double</span> elapsed_seconds);</div>
|
|
<div class="line"><a id="l00271" name="l00271"></a><span class="lineno"> 271</span> </div>
|
|
<div class="line"><a id="l00272" name="l00272"></a><span class="lineno"> 272</span> <span class="comment">// Returns a hash of the given clause variables (not literal) in such a way</span></div>
|
|
<div class="line"><a id="l00273" name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// that hash1 & not(hash2) == 0 iff the set of variable of clause 1 is a</span></div>
|
|
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"> 274</span> <span class="comment">// subset of the one of clause2.</span></div>
|
|
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> uint64_t ComputeSignatureOfClauseVariables(<a class="code hl_typedef" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">ClauseIndex</a> ci);</div>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> </div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <span class="comment">// The "active" variables on which we want to call CrossProduct() are kept</span></div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> <span class="comment">// in a priority queue so that we process first the ones that occur the least</span></div>
|
|
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="comment">// often in the clause database.</span></div>
|
|
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> <span class="keywordtype">void</span> InitializePriorityQueue();</div>
|
|
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> <span class="keywordtype">void</span> UpdatePriorityQueue(BooleanVariable <a class="code hl_variable" href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a>);</div>
|
|
<div class="line"><a id="l00282" name="l00282"></a><span class="lineno"> 282</span> <span class="keyword">struct </span>PQElement {</div>
|
|
<div class="line"><a id="l00283" name="l00283"></a><span class="lineno"> 283</span> PQElement() : heap_index(-1), variable(-1), <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>(0.0) {}</div>
|
|
<div class="line"><a id="l00284" name="l00284"></a><span class="lineno"> 284</span> </div>
|
|
<div class="line"><a id="l00285" name="l00285"></a><span class="lineno"> 285</span> <span class="comment">// Interface for the AdjustablePriorityQueue.</span></div>
|
|
<div class="line"><a id="l00286" name="l00286"></a><span class="lineno"> 286</span> <span class="keywordtype">void</span> SetHeapIndex(<span class="keywordtype">int</span> h) { heap_index = h; }</div>
|
|
<div class="line"><a id="l00287" name="l00287"></a><span class="lineno"> 287</span> <span class="keywordtype">int</span> GetHeapIndex()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index; }</div>
|
|
<div class="line"><a id="l00288" name="l00288"></a><span class="lineno"> 288</span> </div>
|
|
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"> 289</span> <span class="comment">// Priority order. The AdjustablePriorityQueue returns the largest element</span></div>
|
|
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> <span class="comment">// first, but our weight goes this other way around (smaller is better).</span></div>
|
|
<div class="line"><a id="l00291" name="l00291"></a><span class="lineno"> 291</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> PQElement& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00292" name="l00292"></a><span class="lineno"> 292</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> > other.weight;</div>
|
|
<div class="line"><a id="l00293" name="l00293"></a><span class="lineno"> 293</span> }</div>
|
|
<div class="line"><a id="l00294" name="l00294"></a><span class="lineno"> 294</span> </div>
|
|
<div class="line"><a id="l00295" name="l00295"></a><span class="lineno"> 295</span> <span class="keywordtype">int</span> heap_index;</div>
|
|
<div class="line"><a id="l00296" name="l00296"></a><span class="lineno"> 296</span> BooleanVariable variable;</div>
|
|
<div class="line"><a id="l00297" name="l00297"></a><span class="lineno"> 297</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>;</div>
|
|
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"> 298</span> };</div>
|
|
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<BooleanVariable, PQElement></a> var_pq_elements_;</div>
|
|
<div class="line"><a id="l00300" name="l00300"></a><span class="lineno"> 300</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<PQElement></a> var_pq_;</div>
|
|
<div class="line"><a id="l00301" name="l00301"></a><span class="lineno"> 301</span> </div>
|
|
<div class="line"><a id="l00302" name="l00302"></a><span class="lineno"> 302</span> <span class="comment">// Literal priority queue for BVA. The literals are ordered by descending</span></div>
|
|
<div class="line"><a id="l00303" name="l00303"></a><span class="lineno"> 303</span> <span class="comment">// number of occurrences in clauses.</span></div>
|
|
<div class="line"><a id="l00304" name="l00304"></a><span class="lineno"> 304</span> <span class="keywordtype">void</span> InitializeBvaPriorityQueue();</div>
|
|
<div class="line"><a id="l00305" name="l00305"></a><span class="lineno"> 305</span> <span class="keywordtype">void</span> UpdateBvaPriorityQueue(LiteralIndex lit);</div>
|
|
<div class="line"><a id="l00306" name="l00306"></a><span class="lineno"> 306</span> <span class="keywordtype">void</span> AddToBvaPriorityQueue(LiteralIndex lit);</div>
|
|
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"> 307</span> <span class="keyword">struct </span>BvaPqElement {</div>
|
|
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> BvaPqElement() : heap_index(-1), <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>(-1), <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>(0.0) {}</div>
|
|
<div class="line"><a id="l00309" name="l00309"></a><span class="lineno"> 309</span> </div>
|
|
<div class="line"><a id="l00310" name="l00310"></a><span class="lineno"> 310</span> <span class="comment">// Interface for the AdjustablePriorityQueue.</span></div>
|
|
<div class="line"><a id="l00311" name="l00311"></a><span class="lineno"> 311</span> <span class="keywordtype">void</span> SetHeapIndex(<span class="keywordtype">int</span> h) { heap_index = h; }</div>
|
|
<div class="line"><a id="l00312" name="l00312"></a><span class="lineno"> 312</span> <span class="keywordtype">int</span> GetHeapIndex()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> heap_index; }</div>
|
|
<div class="line"><a id="l00313" name="l00313"></a><span class="lineno"> 313</span> </div>
|
|
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"> 314</span> <span class="comment">// Priority order.</span></div>
|
|
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> <span class="comment">// The AdjustablePriorityQueue returns the largest element first.</span></div>
|
|
<div class="line"><a id="l00316" name="l00316"></a><span class="lineno"> 316</span> <span class="keywordtype">bool</span> operator<(<span class="keyword">const</span> BvaPqElement& other)<span class="keyword"> const </span>{</div>
|
|
<div class="line"><a id="l00317" name="l00317"></a><span class="lineno"> 317</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a> < other.weight;</div>
|
|
<div class="line"><a id="l00318" name="l00318"></a><span class="lineno"> 318</span> }</div>
|
|
<div class="line"><a id="l00319" name="l00319"></a><span class="lineno"> 319</span> </div>
|
|
<div class="line"><a id="l00320" name="l00320"></a><span class="lineno"> 320</span> <span class="keywordtype">int</span> heap_index;</div>
|
|
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"> 321</span> LiteralIndex <a class="code hl_variable" href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a>;</div>
|
|
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> <span class="keywordtype">double</span> <a class="code hl_variable" href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a>;</div>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> };</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> std::deque<BvaPqElement> bva_pq_elements_; <span class="comment">// deque because we add variables.</span></div>
|
|
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <a class="code hl_class" href="class_adjustable_priority_queue.html">AdjustablePriorityQueue<BvaPqElement></a> bva_pq_;</div>
|
|
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> </div>
|
|
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> <span class="comment">// Temporary data for SimpleBva().</span></div>
|
|
<div class="line"><a id="l00328" name="l00328"></a><span class="lineno"> 328</span> absl::btree_set<LiteralIndex> m_lit_;</div>
|
|
<div class="line"><a id="l00329" name="l00329"></a><span class="lineno"> 329</span> std::vector<ClauseIndex> m_cls_;</div>
|
|
<div class="line"><a id="l00330" name="l00330"></a><span class="lineno"> 330</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, int></a> literal_to_p_size_;</div>
|
|
<div class="line"><a id="l00331" name="l00331"></a><span class="lineno"> 331</span> std::vector<std::pair<LiteralIndex, ClauseIndex>> flattened_p_;</div>
|
|
<div class="line"><a id="l00332" name="l00332"></a><span class="lineno"> 332</span> std::vector<Literal> tmp_new_clause_;</div>
|
|
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"> 333</span> </div>
|
|
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> <span class="comment">// List of clauses on which we need to call ProcessClauseToSimplifyOthers().</span></div>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <span class="comment">// See ProcessAllClauses().</span></div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> std::vector<bool> in_clause_to_process_;</div>
|
|
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> std::deque<ClauseIndex> clause_to_process_;</div>
|
|
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> </div>
|
|
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> <span class="comment">// The set of all clauses.</span></div>
|
|
<div class="line"><a id="l00340" name="l00340"></a><span class="lineno"> 340</span> <span class="comment">// An empty clause means that it has been removed.</span></div>
|
|
<div class="line"><a id="l00341" name="l00341"></a><span class="lineno"> 341</span> std::vector<std::vector<Literal>> clauses_; <span class="comment">// Indexed by ClauseIndex</span></div>
|
|
<div class="line"><a id="l00342" name="l00342"></a><span class="lineno"> 342</span> </div>
|
|
<div class="line"><a id="l00343" name="l00343"></a><span class="lineno"> 343</span> <span class="comment">// The cached value of ComputeSignatureOfClauseVariables() for each clause.</span></div>
|
|
<div class="line"><a id="l00344" name="l00344"></a><span class="lineno"> 344</span> std::vector<uint64_t> signatures_; <span class="comment">// Indexed by ClauseIndex</span></div>
|
|
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"> 345</span> int64_t num_inspected_signatures_ = 0;</div>
|
|
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> int64_t num_inspected_literals_ = 0;</div>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> </div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <span class="comment">// Occurrence list. For each literal, contains the ClauseIndex of the clause</span></div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="comment">// that contains it (ordered by clause index).</span></div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, std::vector<ClauseIndex></a>></div>
|
|
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span> literal_to_clauses_;</div>
|
|
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
|
<div class="line"><a id="l00353" name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// Because we only lazily clean the occurrence list after clause deletions,</span></div>
|
|
<div class="line"><a id="l00354" name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// we keep the size of the occurrence list (without the deleted clause) here.</span></div>
|
|
<div class="line"><a id="l00355" name="l00355"></a><span class="lineno"> 355</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, int></a> literal_to_clause_sizes_;</div>
|
|
<div class="line"><a id="l00356" name="l00356"></a><span class="lineno"> 356</span> </div>
|
|
<div class="line"><a id="l00357" name="l00357"></a><span class="lineno"> 357</span> <span class="comment">// Used for postsolve.</span></div>
|
|
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"> 358</span> SatPostsolver* postsolver_;</div>
|
|
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> </div>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> <span class="comment">// Equivalent literal mapping.</span></div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, LiteralIndex></a> equiv_mapping_;</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> </div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keywordtype">int</span> num_trivial_clauses_;</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> SatParameters parameters_;</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> DratProofHandler* drat_proof_handler_;</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> TimeLimit* time_limit_ = <span class="keyword">nullptr</span>;</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> SolverLogger* logger_;</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> </div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> DISALLOW_COPY_AND_ASSIGN(<a class="code hl_function" href="classoperations__research_1_1sat_1_1_sat_presolver.html#a270327e7a3140c8373299ba9d27cd99a">SatPresolver</a>);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span>};</div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> </div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span><span class="comment">// Visible for testing. Returns true iff:</span></div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span><span class="comment">// - a subsume b (subsumption): the clause a is a subset of b, in which case</span></div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span><span class="comment">// opposite_literal is set to -1.</span></div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span><span class="comment">// - b is strengthened by self-subsumption using a (self-subsuming resolution):</span></div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span><span class="comment">// the clause a with one of its literal negated is a subset of b, in which</span></div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span><span class="comment">// case opposite_literal is set to this negated literal index. Moreover, this</span></div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span><span class="comment">// opposite_literal is then removed from b.</span></div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span><span class="comment">// If num_inspected_literals_ is not nullptr, the "complexity" of this function</span></div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span><span class="comment">// will be added to it in order to track the amount of work done.</span></div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span><span class="comment">// TODO(user): when a.size() << b.size(), we should use binary search instead</span></div>
|
|
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span><span class="comment">// of scanning b linearly.</span></div>
|
|
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a8f1123fdce4adb44ee8a87b2046ab71d">SimplifyClause</a>(<span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>, std::vector<Literal>* <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>,</div>
|
|
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> LiteralIndex* opposite_literal,</div>
|
|
<div class="line"><a id="l00387" name="l00387"></a><span class="lineno"> 387</span> int64_t* num_inspected_literals = <span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00388" name="l00388"></a><span class="lineno"> 388</span> </div>
|
|
<div class="line"><a id="l00389" name="l00389"></a><span class="lineno"> 389</span><span class="comment">// Visible for testing. Returns kNoLiteralIndex except if:</span></div>
|
|
<div class="line"><a id="l00390" name="l00390"></a><span class="lineno"> 390</span><span class="comment">// - a and b differ in only one literal.</span></div>
|
|
<div class="line"><a id="l00391" name="l00391"></a><span class="lineno"> 391</span><span class="comment">// - For a it is the given literal l.</span></div>
|
|
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"> 392</span><span class="comment">// In which case, returns the LiteralIndex of the literal in b that is not in a.</span></div>
|
|
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span>LiteralIndex <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a7cc19650ad546aee24b7abe12910437c">DifferAtGivenLiteral</a>(<span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, Literal l);</div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> </div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span><span class="comment">// Visible for testing. Computes the resolvant of 'a' and 'b' obtained by</span></div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span><span class="comment">// performing the resolution on 'x'. If the resolvant is trivially true this</span></div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span><span class="comment">// returns false, otherwise it returns true and fill 'out' with the resolvant.</span></div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span><span class="comment">// Note that the resolvant is just 'a' union 'b' with the literals 'x' and</span></div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span><span class="comment">// not(x) removed. The two clauses are assumed to be sorted, and the computed</span></div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span><span class="comment">// resolvant will also be sorted.</span></div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span><span class="comment">// This is the basic operation when a variable is eliminated by clause</span></div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span><span class="comment">// distribution.</span></div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span><span class="keywordtype">bool</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a93ca885a2ad18527fab730188104771a">ComputeResolvant</a>(Literal x, <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>, std::vector<Literal>* out);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> </div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span><span class="comment">// Same as ComputeResolvant() but just returns the resolvant size.</span></div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span><span class="comment">// Returns -1 when ComputeResolvant() returns false.</span></div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span><span class="keywordtype">int</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#a2bf59c05d95db86f40a3d1577429683b">ComputeResolvantSize</a>(Literal x, <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a>,</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> <span class="keyword">const</span> std::vector<Literal>& <a class="code hl_variable" href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a>);</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> </div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span><span class="comment">// Presolver that does literals probing and finds equivalent literals by</span></div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span><span class="comment">// computing the strongly connected components of the graph:</span></div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span><span class="comment">// literal l -> literals propagated by l.</span></div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span><span class="comment">// Clears the mapping if there are no equivalent literals. Otherwise, mapping[l]</span></div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span><span class="comment">// is the representative of the equivalent class of l. Note that mapping[l] may</span></div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span><span class="comment">// be equal to l.</span></div>
|
|
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span><span class="comment">// The postsolver will be updated so it can recover a solution of the mapped</span></div>
|
|
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span><span class="comment">// problem. Note that this works on any problem the SatSolver can handle, not</span></div>
|
|
<div class="line"><a id="l00424" name="l00424"></a><span class="lineno"> 424</span><span class="comment">// only pure SAT problem, but the returned mapping do need to be applied to all</span></div>
|
|
<div class="line"><a id="l00425" name="l00425"></a><span class="lineno"> 425</span><span class="comment">// constraints.</span></div>
|
|
<div class="line"><a id="l00426" name="l00426"></a><span class="lineno"> 426</span><span class="keywordtype">void</span> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac75d30c113a2b2628f0d77e403467815">ProbeAndFindEquivalentLiteral</a>(</div>
|
|
<div class="line"><a id="l00427" name="l00427"></a><span class="lineno"> 427</span> SatSolver* solver, SatPostsolver* postsolver,</div>
|
|
<div class="line"><a id="l00428" name="l00428"></a><span class="lineno"> 428</span> DratProofHandler* drat_proof_handler,</div>
|
|
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"> 429</span> <a class="code hl_class" href="classabsl_1_1_strong_vector.html">absl::StrongVector<LiteralIndex, LiteralIndex></a>* mapping);</div>
|
|
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> </div>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span><span class="comment">// Given a 'solver' with a problem already loaded, this will try to simplify the</span></div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span><span class="comment">// problem (i.e. presolve it) before calling solver->Solve(). In the process,</span></div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span><span class="comment">// because of the way the presolve is implemented, the underlying SatSolver may</span></div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span><span class="comment">// change (it is why we use this unique_ptr interface). In particular, the final</span></div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span><span class="comment">// variables and 'solver' state may have nothing to do with the problem</span></div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span><span class="comment">// originaly present in the solver. That said, if the problem is shown to be</span></div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span><span class="comment">// SAT, then the returned solution will be in term of the original variables.</span></div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span><span class="comment">//</span></div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span><span class="comment">// Note that the full presolve is only executed if the problem is a pure SAT</span></div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span><span class="comment">// problem with only clauses.</span></div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span><a class="code hl_enumeration" href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">SatSolver::Status</a> <a class="code hl_function" href="namespaceoperations__research_1_1sat.html#ac72c9c226ad6604afc77b5392c60c086">SolveWithPresolve</a>(</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> std::unique_ptr<SatSolver>* solver, TimeLimit* <a class="code hl_variable" href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a>,</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> std::vector<bool>* solution <span class="comment">/* only filled if SAT */</span>,</div>
|
|
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> DratProofHandler* drat_proof_handler <span class="comment">/* can be nullptr */</span>,</div>
|
|
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span> SolverLogger* logger);</div>
|
|
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
|
|
<div class="line"><a id="l00447" name="l00447"></a><span class="lineno"> 447</span>} <span class="comment">// namespace sat</span></div>
|
|
<div class="line"><a id="l00448" name="l00448"></a><span class="lineno"> 448</span>} <span class="comment">// namespace operations_research</span></div>
|
|
<div class="line"><a id="l00449" name="l00449"></a><span class="lineno"> 449</span> </div>
|
|
<div class="line"><a id="l00450" name="l00450"></a><span class="lineno"> 450</span><span class="preprocessor">#endif </span><span class="comment">// OR_TOOLS_SAT_SIMPLIFICATION_H_</span></div>
|
|
<div class="ttc" id="aadjustable__priority__queue_8h_html"><div class="ttname"><a href="adjustable__priority__queue_8h.html">adjustable_priority_queue.h</a></div></div>
|
|
<div class="ttc" id="aclass_adjustable_priority_queue_html"><div class="ttname"><a href="class_adjustable_priority_queue.html">AdjustablePriorityQueue< PQElement ></a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html"><div class="ttname"><a href="classabsl_1_1_strong_vector.html">absl::StrongVector< BooleanVariable, BooleanVariable ></a></div></div>
|
|
<div class="ttc" id="aclassabsl_1_1_strong_vector_html_a60304b65bf89363bcc3165d3cde67f86"><div class="ttname"><a href="classabsl_1_1_strong_vector.html#a60304b65bf89363bcc3165d3cde67f86">absl::StrongVector::size</a></div><div class="ttdeci">size_type size() const</div><div class="ttdef"><b>Definition:</b> <a href="strong__vector_8h_source.html#l00147">strong_vector.h:147</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_solver_logger_html"><div class="ttname"><a href="classoperations__research_1_1_solver_logger.html">operations_research::SolverLogger</a></div><div class="ttdef"><b>Definition:</b> <a href="util_2logging_8h_source.html#l00033">util/logging.h:33</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1_time_limit_html"><div class="ttname"><a href="classoperations__research_1_1_time_limit.html">operations_research::TimeLimit</a></div><div class="ttdoc">A simple class to enforce both an elapsed time limit and a deterministic time limit in the same threa...</div><div class="ttdef"><b>Definition:</b> <a href="time__limit_8h_source.html#l00106">time_limit.h:106</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_drat_proof_handler_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_drat_proof_handler.html">operations_research::sat::DratProofHandler</a></div><div class="ttdef"><b>Definition:</b> <a href="drat__proof__handler_8h_source.html#l00043">drat_proof_handler.h:43</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_literal_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_literal.html">operations_research::sat::Literal</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00067">sat_base.h:67</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html">operations_research::sat::SatPostsolver</a></div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00050">simplification.h:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a024e94c6e22e2fe747bb4355b52a8eab"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a024e94c6e22e2fe747bb4355b52a8eab">operations_research::sat::SatPostsolver::Add</a></div><div class="ttdeci">void Add(Literal x, const absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00059">simplification.cc:59</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a235d38393e2379eb6a016446341d2102"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a235d38393e2379eb6a016446341d2102">operations_research::sat::SatPostsolver::NumClauses</a></div><div class="ttdeci">int NumClauses() const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00086">simplification.h:86</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a3b174af81ff48a2cf33d23179125b356"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a3b174af81ff48a2cf33d23179125b356">operations_research::sat::SatPostsolver::SatPostsolver</a></div><div class="ttdeci">SatPostsolver(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00050">simplification.cc:50</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a40432775821777983c4df6b4f2a71d92"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a40432775821777983c4df6b4f2a71d92">operations_research::sat::SatPostsolver::FixVariable</a></div><div class="ttdeci">void FixVariable(Literal x)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00069">simplification.cc:69</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a8155216960c6e1f5d476e1c28b2d34fa"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a8155216960c6e1f5d476e1c28b2d34fa">operations_research::sat::SatPostsolver::ApplyMapping</a></div><div class="ttdeci">void ApplyMapping(const absl::StrongVector< BooleanVariable, BooleanVariable > &mapping)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00074">simplification.cc:74</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_a8995563af871eb8c2b05bf99bd89344a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#a8995563af871eb8c2b05bf99bd89344a">operations_research::sat::SatPostsolver::PostsolveSolution</a></div><div class="ttdeci">std::vector< bool > PostsolveSolution(const std::vector< bool > &solution)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00152">simplification.cc:152</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_aa6e59b763fa9265e1a3487de47d5fddc"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#aa6e59b763fa9265e1a3487de47d5fddc">operations_research::sat::SatPostsolver::Clause</a></div><div class="ttdeci">std::vector< Literal > Clause(int i) const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00087">simplification.h:87</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_postsolver_html_ac6f385a340d67f08c9f3d8e686ebf571"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_postsolver.html#ac6f385a340d67f08c9f3d8e686ebf571">operations_research::sat::SatPostsolver::ExtractAndPostsolveSolution</a></div><div class="ttdeci">std::vector< bool > ExtractAndPostsolveSolution(const SatSolver &solver)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00141">simplification.cc:141</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html">operations_research::sat::SatPresolver</a></div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00146">simplification.h:146</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a0b58ef3a397720b272662f8bc45585cb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a0b58ef3a397720b272662f8bc45585cb">operations_research::sat::SatPresolver::SetNumVariables</a></div><div class="ttdeci">void SetNumVariables(int num_variables)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00228">simplification.cc:228</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a0ccb7f8f94de0435ec83e71d52b61511"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a0ccb7f8f94de0435ec83e71d52b61511">operations_research::sat::SatPresolver::Clause</a></div><div class="ttdeci">const std::vector< Literal > & Clause(ClauseIndex ci) const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00186">simplification.h:186</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a11c34313bd8d2e6ac75054fd4bc51a8a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a11c34313bd8d2e6ac75054fd4bc51a8a">operations_research::sat::SatPresolver::LoadProblemIntoSatSolver</a></div><div class="ttdeci">void LoadProblemIntoSatSolver(SatSolver *solver)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00273">simplification.cc:273</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a235d38393e2379eb6a016446341d2102"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a235d38393e2379eb6a016446341d2102">operations_research::sat::SatPresolver::NumClauses</a></div><div class="ttdeci">int NumClauses() const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00185">simplification.h:185</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a26fc07b3630b79be6914e6387b63a073"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a26fc07b3630b79be6914e6387b63a073">operations_research::sat::SatPresolver::AddBinaryClause</a></div><div class="ttdeci">void AddBinaryClause(Literal a, Literal b)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00171">simplification.cc:171</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a270327e7a3140c8373299ba9d27cd99a"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a270327e7a3140c8373299ba9d27cd99a">operations_research::sat::SatPresolver::SatPresolver</a></div><div class="ttdeci">SatPresolver(SatPostsolver *postsolver, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00151">simplification.h:151</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a3f9bc2c396e3354ce7a6cf09427474a8"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a3f9bc2c396e3354ce7a6cf09427474a8">operations_research::sat::SatPresolver::SetEquivalentLiteralMapping</a></div><div class="ttdeci">void SetEquivalentLiteralMapping(const absl::StrongVector< LiteralIndex, LiteralIndex > &mapping)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00162">simplification.h:162</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a4357280dffaba15fcb7f932afe0aea3f"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a4357280dffaba15fcb7f932afe0aea3f">operations_research::sat::SatPresolver::Presolve</a></div><div class="ttdeci">bool Presolve()</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00331">simplification.cc:331</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a5ddcb2924990b8dbcf375f7c19846218"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a5ddcb2924990b8dbcf375f7c19846218">operations_research::sat::SatPresolver::PresolveWithBva</a></div><div class="ttdeci">void PresolveWithBva()</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00385">simplification.cc:385</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a687eb5f7ae0e0268094f954adff08d8d"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a687eb5f7ae0e0268094f954adff08d8d">operations_research::sat::SatPresolver::SetParameters</a></div><div class="ttdeci">void SetParameters(const SatParameters &params)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00157">simplification.h:157</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a69b55d318122f02f0fb03fb1c070ab37"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a69b55d318122f02f0fb03fb1c070ab37">operations_research::sat::SatPresolver::VariableMapping</a></div><div class="ttdeci">absl::StrongVector< BooleanVariable, BooleanVariable > VariableMapping() const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00258">simplification.cc:258</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a75f1d17f36330a1c8a96e43fe8805598"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a75f1d17f36330a1c8a96e43fe8805598">operations_research::sat::SatPresolver::SetDratProofHandler</a></div><div class="ttdeci">void SetDratProofHandler(DratProofHandler *drat_proof_handler)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00225">simplification.h:225</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a7ee10d17bc38aefeba27eb35d597d3d7"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a7ee10d17bc38aefeba27eb35d597d3d7">operations_research::sat::SatPresolver::ClauseIndex</a></div><div class="ttdeci">int32_t ClauseIndex</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00149">simplification.h:149</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a98bacf41c50979896b4a5f5e41fb0ccf"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a98bacf41c50979896b4a5f5e41fb0ccf">operations_research::sat::SatPresolver::AddClause</a></div><div class="ttdeci">void AddClause(absl::Span< const Literal > clause)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00173">simplification.cc:173</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_a9d3beb2afe4ae647674b054bf29290e2"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#a9d3beb2afe4ae647674b054bf29290e2">operations_research::sat::SatPresolver::NumVariables</a></div><div class="ttdeci">int NumVariables() const</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00192">simplification.h:192</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_ac36d4cd02bbf1501a134d61fc510ad68"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#ac36d4cd02bbf1501a134d61fc510ad68">operations_research::sat::SatPresolver::ProcessClauseToSimplifyOthers</a></div><div class="ttdeci">bool ProcessClauseToSimplifyOthers(ClauseIndex clause_index)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00637">simplification.cc:637</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_ad99bfbfbdeb3354d3694aecd7fda6deb"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#ad99bfbfbdeb3354d3694aecd7fda6deb">operations_research::sat::SatPresolver::SetTimeLimit</a></div><div class="ttdeci">void SetTimeLimit(TimeLimit *time_limit)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8h_source.html#l00158">simplification.h:158</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_presolver_html_ae39cbe1919d9200f3f41cf96b7eee703"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_presolver.html#ae39cbe1919d9200f3f41cf96b7eee703">operations_research::sat::SatPresolver::CrossProduct</a></div><div class="ttdeci">bool CrossProduct(Literal x)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00713">simplification.cc:713</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html">operations_research::sat::SatSolver</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00061">sat_solver.h:61</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_sat_solver_html_a67a0db04d321a74b7e7fcfd3f1a3f70b"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_sat_solver.html#a67a0db04d321a74b7e7fcfd3f1a3f70b">operations_research::sat::SatSolver::Status</a></div><div class="ttdeci">Status</div><div class="ttdef"><b>Definition:</b> <a href="sat__solver_8h_source.html#l00183">sat_solver.h:183</a></div></div>
|
|
<div class="ttc" id="aclassoperations__research_1_1sat_1_1_variables_assignment_html"><div class="ttname"><a href="classoperations__research_1_1sat_1_1_variables_assignment.html">operations_research::sat::VariablesAssignment</a></div><div class="ttdef"><b>Definition:</b> <a href="sat__base_8h_source.html#l00125">sat_base.h:125</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_a9293e4d29cac928301645070dd307683"><div class="ttname"><a href="constraint__solver_2table_8cc.html#a9293e4d29cac928301645070dd307683">b</a></div><div class="ttdeci">int64_t b</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00047">constraint_solver/table.cc:47</a></div></div>
|
|
<div class="ttc" id="aconstraint__solver_2table_8cc_html_acb18315d548212835cd8ed4287e6c0b6"><div class="ttname"><a href="constraint__solver_2table_8cc.html#acb18315d548212835cd8ed4287e6c0b6">a</a></div><div class="ttdeci">int64_t a</div><div class="ttdef"><b>Definition:</b> <a href="constraint__solver_2table_8cc_source.html#l00046">constraint_solver/table.cc:46</a></div></div>
|
|
<div class="ttc" id="acp__model__solver_8cc_html_aec8af5c1be4e1b6d4330e1161028de21"><div class="ttname"><a href="cp__model__solver_8cc.html#aec8af5c1be4e1b6d4330e1161028de21">time_limit</a></div><div class="ttdeci">ModelSharedTimeLimit * time_limit</div><div class="ttdef"><b>Definition:</b> <a href="cp__model__solver_8cc_source.html#l02050">cp_model_solver.cc:2050</a></div></div>
|
|
<div class="ttc" id="adrat__proof__handler_8h_html"><div class="ttname"><a href="drat__proof__handler_8h.html">drat_proof_handler.h</a></div></div>
|
|
<div class="ttc" id="aexpr__array_8cc_html_a472a99923cbe11ae7b5a5d157d9ad465"><div class="ttname"><a href="expr__array_8cc.html#a472a99923cbe11ae7b5a5d157d9ad465">var</a></div><div class="ttdeci">IntVar * var</div><div class="ttdef"><b>Definition:</b> <a href="expr__array_8cc_source.html#l01874">expr_array.cc:1874</a></div></div>
|
|
<div class="ttc" id="aintegral__types_8h_html"><div class="ttname"><a href="integral__types_8h.html">integral_types.h</a></div></div>
|
|
<div class="ttc" id="amacros_8h_html"><div class="ttname"><a href="macros_8h.html">macros.h</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1math__opt_html_a5de89a1f6e3f80a49a0d76136d8044e2"><div class="ttname"><a href="namespaceoperations__research_1_1math__opt.html#a5de89a1f6e3f80a49a0d76136d8044e2">operations_research::math_opt::swap</a></div><div class="ttdeci">void swap(IdMap< K, V > &a, IdMap< K, V > &b)</div><div class="ttdef"><b>Definition:</b> <a href="id__map_8h_source.html#l00262">id_map.h:262</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a2bf59c05d95db86f40a3d1577429683b"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a2bf59c05d95db86f40a3d1577429683b">operations_research::sat::ComputeResolvantSize</a></div><div class="ttdeci">int ComputeResolvantSize(Literal x, const std::vector< Literal > &a, const std::vector< Literal > &b)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l01060">simplification.cc:1060</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a7cc19650ad546aee24b7abe12910437c"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a7cc19650ad546aee24b7abe12910437c">operations_research::sat::DifferAtGivenLiteral</a></div><div class="ttdeci">LiteralIndex DifferAtGivenLiteral(const std::vector< Literal > &a, const std::vector< Literal > &b, Literal l)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00991">simplification.cc:991</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a8f1123fdce4adb44ee8a87b2046ab71d"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a8f1123fdce4adb44ee8a87b2046ab71d">operations_research::sat::SimplifyClause</a></div><div class="ttdeci">bool SimplifyClause(const std::vector< Literal > &a, std::vector< Literal > *b, LiteralIndex *opposite_literal, int64_t *num_inspected_literals)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l00943">simplification.cc:943</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_a93ca885a2ad18527fab730188104771a"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#a93ca885a2ad18527fab730188104771a">operations_research::sat::ComputeResolvant</a></div><div class="ttdeci">bool ComputeResolvant(Literal x, const std::vector< Literal > &a, const std::vector< Literal > &b, std::vector< Literal > *out)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l01025">simplification.cc:1025</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac72c9c226ad6604afc77b5392c60c086"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac72c9c226ad6604afc77b5392c60c086">operations_research::sat::SolveWithPresolve</a></div><div class="ttdeci">SatSolver::Status SolveWithPresolve(std::unique_ptr< SatSolver > *solver, TimeLimit *time_limit, std::vector< bool > *solution, DratProofHandler *drat_proof_handler, SolverLogger *logger)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l01259">simplification.cc:1259</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_1_1sat_html_ac75d30c113a2b2628f0d77e403467815"><div class="ttname"><a href="namespaceoperations__research_1_1sat.html#ac75d30c113a2b2628f0d77e403467815">operations_research::sat::ProbeAndFindEquivalentLiteral</a></div><div class="ttdeci">void ProbeAndFindEquivalentLiteral(SatSolver *solver, SatPostsolver *postsolver, DratProofHandler *drat_proof_handler, absl::StrongVector< LiteralIndex, LiteralIndex > *mapping)</div><div class="ttdef"><b>Definition:</b> <a href="simplification_8cc_source.html#l01141">simplification.cc:1141</a></div></div>
|
|
<div class="ttc" id="anamespaceoperations__research_html"><div class="ttname"><a href="namespaceoperations__research.html">operations_research</a></div><div class="ttdoc">Collection of objects used to extend the Constraint Solver library.</div><div class="ttdef"><b>Definition:</b> <a href="dense__doubly__linked__list_8h_source.html#l00021">dense_doubly_linked_list.h:21</a></div></div>
|
|
<div class="ttc" id="aoptimization_8cc_html_af63dcc00f2023fdf498e0829e6fb8a6b"><div class="ttname"><a href="optimization_8cc.html#af63dcc00f2023fdf498e0829e6fb8a6b">literal</a></div><div class="ttdeci">Literal literal</div><div class="ttdef"><b>Definition:</b> <a href="optimization_8cc_source.html#l00089">optimization.cc:89</a></div></div>
|
|
<div class="ttc" id="apack_8cc_html_a4255f714cea26cdd64f6a0ee72d34a8c"><div class="ttname"><a href="pack_8cc.html#a4255f714cea26cdd64f6a0ee72d34a8c">weight</a></div><div class="ttdeci">int64_t weight</div><div class="ttdef"><b>Definition:</b> <a href="pack_8cc_source.html#l00510">pack.cc:510</a></div></div>
|
|
<div class="ttc" id="asat__base_8h_html"><div class="ttname"><a href="sat__base_8h.html">sat_base.h</a></div></div>
|
|
<div class="ttc" id="asat__solver_8h_html"><div class="ttname"><a href="sat__solver_8h.html">sat_solver.h</a></div></div>
|
|
<div class="ttc" id="asparse__submatrix_8cc_html_a4d53eac2ef2732c28fa9fb663e0c19a7"><div class="ttname"><a href="sparse__submatrix_8cc.html#a4d53eac2ef2732c28fa9fb663e0c19a7">end</a></div><div class="ttdeci">std::optional< int64_t > end</div><div class="ttdef"><b>Definition:</b> <a href="sparse__submatrix_8cc_source.html#l00036">sparse_submatrix.cc:36</a></div></div>
|
|
<div class="ttc" id="astrong__integers_8h_html"><div class="ttname"><a href="strong__integers_8h.html">strong_integers.h</a></div></div>
|
|
<div class="ttc" id="astrong__vector_8h_html"><div class="ttname"><a href="strong__vector_8h.html">strong_vector.h</a></div></div>
|
|
<div class="ttc" id="atime__limit_8h_html"><div class="ttname"><a href="time__limit_8h.html">time_limit.h</a></div></div>
|
|
<div class="ttc" id="autil_2logging_8h_html"><div class="ttname"><a href="util_2logging_8h.html">logging.h</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
<!-- HTML footer for doxygen 1.8.18-->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a class="el" href="dir_a7cc1eeded8f693d0da6c729bc88c45a.html">ortools</a></li><li class="navelem"><a class="el" href="dir_dddac007a45022d9da6ea1dee012c3b9.html">sat</a></li><li class="navelem"><a class="el" href="simplification_8h.html">simplification.h</a></li>
|
|
<li class="footer">Generated by
|
|
<a href="http://www.doxygen.org/index.html">
|
|
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.9.3 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|