-
Notifications
You must be signed in to change notification settings - Fork 41
/
satisfy.html
255 lines (217 loc) · 7.17 KB
/
satisfy.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
<html>
<head>
<title>
SATISFY - Seek Binary Circuit Inputs that Output 1
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
SATISFY <br> Seek Binary Circuit Inputs that Output 1
</h1>
<hr>
<p>
<b>SATISFY</b>
is a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem.
</p>
<p>
This problem assumes that we are given a logical circuit of AND, OR and NOT
gates, with N binary inputs and a single output. We are to determine all
inputs which produce a 1 as the output.
</p>
<p>
The general problem is NP complete, so there is no known polynomial-time
algorithm to solve the general case. The natural way to search for solutions
then is exhaustive search.
</p>
<p>
In an interesting way, this is a very extreme and discrete version of
the problem of maximizing a scalar function of multiple variables.
The difference is that here we know that both the input and output
only have the values 0 and 1, rather than a continuous range of real
values!
</p>
<p>
This problem is a natural candidate for parallel computation, since
the individual evaluations of the circuit are completely independent.
</p>
<p>
The example circuit considered here has been described in conjunctive
normal form ("CNF"). This is a standard format for logical formulas.
At the highest level, the formula consists of <i>clauses</i> joined
by the <b>AND</b> (conjunction) operator. Each clause consists of
<i>signed literals</i> joined by the <b>OR</b> (disjunction) operator.
Each signed literal is either the name of a variable (positive literal),
or the name of a variable preceded by the <b>NOT</b> (negation) operator
(a negative literal). There is a CNF file format that can be used to
store logical formulas that have been cast into conjunctive normal form.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>SATISFY</b> is available in
<a href = "../../c_src/satisfy/satisfy.html">a C version</a> and
<a href = "../../cpp_src/satisfy/satisfy.html">a C++ version</a> and
<a href = "../../f77_src/satisfy/satisfy.html">a FORTRAN77 version</a> and
<a href = "../../f_src/satisfy/satisfy.html">a FORTRAN90 version</a> and
<a href = "../../m_src/satisfy/satisfy.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/change_making/change_making.html">
CHANGE_MAKING</a>,
a C++ library which
considers the change making problem,
in which a given sum is to be formed using coins of various denominations.
</p>
<p>
<a href = "../../data/cnf/cnf.html">
CNF</a>,
a data directory which
describes the DIMACS CNF file format for defining instances of the
satisfy problem for boolean formulas in conjunctive normal form.
</p>
<p>
<a href = "../../cpp_src/combo/combo.html">
COMBO</a>,
a C++ library which
includes many combinatorial routines.
</p>
<p>
<a href = "../../cpp_src/knapsack_01/knapsack_01.html">
KNAPSACK_01</a>,
a C++ library which
uses brute force to solve small versions of the 0/1 knapsack problem;
</p>
<p>
<a href = "../../cpp_src/partition_problem/partition_problem.html">
PARTITION_PROBLEM</a>,
a C++ library which
seeks solutions of the partition problem, splitting a set of integers into
two subsets with equal sum.
</p>
<p>
<a href = "../../cpp_src/satisfy_mpi/satisfy_mpi.html">
SATISFY_MPI</a>,
a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfy problem, using MPI to
carry out the calculation in parallel.
</p>
<p>
<a href = "../../cpp_src/satisfy_openmp/satisfy_openmp.html">
SATISFY_OPENMP</a>,
a C++ program which
solves the circuit satisfy problem using the OpenMP parallel programming system.
</p>
<p>
<a href = "../../cpp_src/search_serial/search_serial.html">
SEARCH_SERIAL</a>,
a C++ program which
searches the integers from A to B for a value J such that F(J) = C.
this version of the program is intended as a starting point for
a parallel approach.
</p>
<p>
<a href = "../../cpp_src/subset/subset.html">
SUBSET</a>,
a C++ library which
enumerates combinations, partitions, subsets, index sets,
and other combinatorial objects.
</p>
<p>
<a href = "../../cpp_src/tsp_brute/tsp_brute.html">
TSP_BRUTE</a>,
a C++ program which
reads a file of city-to-city distances and solves the
traveling salesperson problem, using brute force.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Rina Dechter,<br>
Enhancement Schemes for constraint processing:
Backjumping, learning, and cutset decomposition,<br>
Artificial Intelligence,<br>
Volume 41, Number 3, January 1990, pages 273-312.
</li>
<li>
Michael Quinn,<br>
Parallel Programming in C with MPI and OpenMP,<br>
McGraw-Hill, 2004,<br>
ISBN13: 978-0071232654,<br>
LC: QA76.73.C15.Q55.
</li>
<li>
Steven Skiena,<br>
The Algorithm Design Manual,<br>
Springer, 1997,<br>
ISBN: 0-387-94860-0,<br>
LC: QA76.9.A43S55.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "satisfy.cpp">satisfy.cpp</a>, the source code.
</li>
<li>
<a href = "satisfy.sh">satisfy.sh</a>,
commands to compile and run the source code.
</li>
<li>
<a href = "satisfy_output.txt">satisfy_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>MAIN</b> is the main program for SATISFY.
</li>
<li>
<b>BVEC_NEXT</b> generates the next binary vector.
</li>
<li>
<b>CIRCUIT_VALUE</b> returns the value of a circuit for a given input set.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last revised on 02 May 2008.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>