-
Notifications
You must be signed in to change notification settings - Fork 0
/
logics.shtml
449 lines (430 loc) · 19.1 KB
/
logics.shtml
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
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<!--
Design by http://www.bluewebtemplates.com
Released for free under a Creative Commons Attribution 3.0 License
-->
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>SMT-LIB The Satisfiability Modulo Theories Library</title>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8" />
<link href="style.css" rel="stylesheet" type="text/css" />
<!-- CuFon: Enables smooth pretty custom font rendering. 100% SEO friendly. To disable, remove this section -->
<script type="text/javascript" src="js/cufon-yui.js"></script>
<script type="text/javascript" src="js/arial.js"></script>
<script type="text/javascript" src="js/cuf_run.js"></script>
<!-- CuFon ends -->
<link href="code-prettify/prettify.css" type="text/css" rel="stylesheet" />
<script src="code-prettify/run_prettify.js?lang=smtlib&skin=desert"></script>
</head>
<body>
<div class="main">
<div class="header">
<div class="header_resize">
<div class="menu_nav">
<ul>
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li class="active"><a href="standard.shtml">Standard</a></li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li><a href="software.shtml">Software</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
</div>
<div class="clr"></div>
<div class="logo">
<h1><a href="index.shtml">SMT-LIB <br/>
<small>The Satisfiability Modulo Theories Library</small></a>
</h1>
</div>
</div>
</div>
<div class="content">
<div class="content_resize">
<div class="mainbar">
<h2>Logics</h2>
<p>SMT-LIB 2 scripts, which includes all the benchmarks available from the <a href="benchmarks.shtml">Benchmarks</a> section, refer to one of the following sub-logics of the main SMT-LIB logic.
The reason to have a (sub-)logic is pragmatic: to identify fragment of the main logic where it may possible to apply specialized and more efficient satisfiability techniques.
New logics are added to the standard opportunistically, once enough benchmarks are available for it.
</p>
<p>Here is an overview of the logics listed below, ordered by inclusion. A link from a logic L1 to a logic L2 means that every formula of L1 is also a formula of L2. Click on the node to go to its description. Then, click on the logic's name to see its specification in SMT-LIB format.
<center>
<img border=0 src="Logics/logics.png" usemap="#logicsDag" />
<map id="logicsDag" name="logicsDag">
<area shape="poly" id="node2" href="#AUFLIA" title="AUFLIA" alt="" coords="622,161,620,156,614,152,605,148,594,146,581,145,569,146,557,148,548,152,543,156,541,161,543,166,548,171,557,175,569,177,581,178,594,177,605,175,614,171,620,166"/>
<area shape="poly" id="node3" href="#AUFLIRA" title="AUFLIRA" alt="" coords="627,260,625,255,618,251,608,247,595,245,581,244,567,245,554,247,544,251,538,255,535,260,538,265,544,270,554,274,567,276,581,277,595,276,608,274,618,270,625,265"/>
<area shape="poly" id="node4" href="#AUFNIRA" title="AUFNIRA" alt="" coords="755,283,752,278,746,274,735,270,722,268,708,267,693,268,680,270,670,274,663,278,661,283,663,288,670,293,680,297,693,299,708,300,722,299,735,297,746,293,752,288"/>
<area shape="poly" id="node5" href="#LIA" title="LIA" alt="" coords="329,70,328,65,324,60,319,56,312,54,304,53,297,54,290,56,284,60,281,65,280,70,281,75,284,79,290,83,297,85,304,86,312,85,319,83,324,79,328,75"/>
<area shape="poly" id="node10" href="#UFNIA" title="UFNIA" alt="" coords="616,112,615,107,610,102,602,98,592,96,581,95,570,96,561,98,553,102,548,107,546,112,548,117,553,122,561,125,570,128,581,128,592,128,602,125,610,122,615,117"/>
<area shape="poly" id="node7" href="#LRA" title="LRA" alt="" coords="331,352,330,347,326,342,320,339,313,336,304,336,296,336,289,339,283,342,279,347,278,352,279,357,283,362,289,365,296,368,304,369,313,368,320,365,326,362,330,357"/>
<area shape="poly" id="node9" href="#UFLRA" title="UFLRA" alt="" coords="483,260,482,255,476,251,468,247,458,245,446,244,435,245,425,247,417,251,411,255,409,260,411,265,417,270,425,274,435,276,446,277,458,276,468,274,476,270,482,265"/>
<area shape="poly" id="node11" href="#QF_ABV" title="QF_ABV" alt="" coords="211,303,209,297,203,293,194,289,182,287,169,286,156,287,144,289,134,293,128,297,126,303,128,308,134,312,144,316,156,318,169,319,182,318,194,316,203,312,209,308"/>
<area shape="poly" id="node12" href="#QF_AUFBV" title="QF_AUFBV" alt="" coords="357,268,355,263,347,258,336,254,321,252,304,251,288,252,273,254,261,258,254,263,251,268,254,273,261,277,273,281,288,283,304,284,321,283,336,281,347,277,355,273"/>
<area shape="poly" id="node14" href="#QF_AUFLIA" title="QF_AUFLIA" alt="" coords="502,161,499,156,491,152,479,148,464,146,446,145,429,146,414,148,402,152,394,156,391,161,394,166,402,171,414,175,429,177,446,178,464,177,479,175,491,171,499,166"/>
<area shape="poly" id="node15" href="#QF_AX" title="QF_AX" alt="" coords="82,91,80,86,75,81,67,77,56,75,45,74,34,75,23,77,15,81,10,86,8,91,10,96,15,100,23,104,34,106,45,107,56,106,67,104,75,100,80,96"/>
<area shape="poly" id="node16" href="#QF_BV" title="QF_BV" alt="" coords="81,281,79,276,74,272,66,268,56,266,45,265,34,266,24,268,16,272,10,276,9,281,10,287,16,291,24,295,34,297,45,298,56,297,66,295,74,291,79,287"/>
<area shape="poly" id="node17" href="#QF_UFBV" title="QF_UFBV" alt="" coords="216,253,213,248,207,243,196,240,183,237,169,237,154,237,141,240,131,243,124,248,122,253,124,258,131,263,141,266,154,269,169,270,183,269,196,266,207,263,213,258"/>
<area shape="poly" id="node18" href="#QF_IDL" title="QF_IDL" alt="" coords="84,140,82,135,76,131,68,127,57,125,45,124,33,125,22,127,14,131,8,135,6,140,8,145,14,150,22,154,33,156,45,157,57,156,68,154,76,150,82,145"/>
<area shape="poly" id="node19" href="#QF_LIA" title="QF_LIA" alt="" coords="207,119,205,114,200,109,191,106,181,103,169,103,157,103,146,106,137,109,132,114,130,119,132,124,137,129,146,133,157,135,169,136,181,135,191,133,200,129,205,124"/>
<area shape="poly" id="node20" href="#QF_UFIDL" title="QF_UFIDL" alt="" coords="218,169,216,164,209,159,198,155,184,153,169,152,153,153,140,155,129,159,122,164,119,169,122,174,129,178,140,182,153,184,169,185,184,184,198,182,209,178,216,174"/>
<area shape="poly" id="node21" href="#QF_NIA" title="QF_NIA" alt="" coords="344,20,342,15,336,10,327,7,316,4,304,4,292,4,281,7,273,10,267,15,265,20,267,25,273,30,281,34,292,36,304,37,316,36,327,34,336,30,342,25"/>
<area shape="poly" id="node22" href="#QF_UFLIA" title="QF_UFLIA" alt="" coords="354,169,351,164,344,159,333,155,320,153,304,152,289,153,275,155,264,159,257,164,255,169,257,174,264,178,275,182,289,184,304,185,320,184,333,182,344,178,351,174"/>
<area shape="poly" id="node23" href="#QF_LRA" title="QF_LRA" alt="" coords="210,352,208,347,202,342,193,339,181,336,169,336,156,336,145,339,135,342,130,347,128,352,130,357,135,362,145,365,156,368,169,369,181,368,193,365,202,362,208,357"/>
<area shape="poly" id="node24" href="#QF_NRA" title="QF_NRA" alt="" coords="347,402,345,396,339,392,329,388,317,386,304,385,291,386,279,388,270,392,264,396,262,402,264,407,270,411,279,415,291,417,304,418,317,417,329,415,339,411,345,407"/>
<area shape="poly" id="node25" href="#QF_UFNRA" title="QF_UFNRA" alt="" coords="499,310,497,305,489,300,478,296,463,294,446,293,430,294,415,296,404,300,396,305,393,310,396,315,404,320,415,323,430,326,446,326,463,326,478,323,489,320,497,315"/>
<area shape="poly" id="node26" href="#QF_RDL" title="QF_RDL" alt="" coords="86,352,84,347,78,342,69,339,58,336,45,336,32,336,21,339,12,342,6,347,4,352,6,357,12,362,21,365,32,368,45,369,58,368,69,365,78,362,84,357"/>
<area shape="poly" id="node27" href="#QF_UF" title="QF_UF" alt="" coords="80,211,78,206,73,201,66,197,56,195,45,194,34,195,24,197,16,201,11,206,10,211,11,216,16,221,24,224,34,227,45,227,56,227,66,224,73,221,78,216"/>
<area shape="poly" id="node28" href="#QF_UFLRA" title="QF_UFLRA" alt="" coords="356,218,354,213,346,208,335,205,320,202,304,202,288,202,274,205,262,208,255,213,253,218,255,223,262,228,274,232,288,234,304,235,320,234,335,232,346,228,354,223"/>
</map>
</center>
The logics have been named using letter groups that evoke the theories used by the logics and some major restriction in their language, with the following conventions:
<ul>
<li><b>QF</b> for the restriction to quantifier free formulas
</li>
<li><b>A</b> or <b>AX</b> for the theory <a href="theories-ArraysEx.shtml">ArraysEx</a>
</li>
<li><b>BV</b> for the theory <a href="theories-FixedSizeBitVectors.shtml">FixedSizeBitVectors</a>
</li>
<li><b>FP</b> (forthcoming) for the theory <a href="theories-FloatingPoint.shtml">FloatingPoint</a>
</li>
<li><b>IA</b> for the theory <a href="theories-Ints.shtml">Ints</a> (Integer Arithmetic)
<li><b>RA</b> for the theory <a href="theories-Reals.shtml">Reals</a> (Real Arithmetic)
<li><b>IRA</b> for the theory <a href="theories-Reals_Ints.shtml">Reals_Ints</a> (mixed Integer Real Arithmetic)
</li>
<li><b>IDL</b> for Integer Difference Logic
</li>
<li><b>RDL</b> for Rational Difference Logic
</li>
<li><b>L</b> before <b>IA</b>, <b>RA</b>, or <b>IRA</b> for the linear fragment of those arithmetics
</li>
<li><b>N</b> before <b>IA</b>, <b>RA</b>, or <b>IRA</b> for the non-linear fragment of those arithmetics
</li>
<li><b>UF</b> for the extension allowing free sort and function symbols
</li>
</ul>
The reason for this, admittedly idiosyncratic, nomenclature is mostly historical.
Also historical is the fact that some logics impose further restrictions on the language. For instance, in the *A*LIA logics the only array sort allowed is <code>(Array Int Int)</code>, whereas in some A*IRA logics the only array sort allowed are <code>(Array Int Real)</code> and <code>(Array Int (Array Int Real))</code>.
This is why, for instance, QF_AX is not a sublogic of QF_AUFLIA or QF_ABV.
Finally, benchmarks are typically classified by the smallest logic they belong to.
One consequence of this is that we do not have
a logic such as RA here, for instance, since an RA benchmark belongs to either LRA or NRA.
</p>
<h3>Logic Descriptions</h3>
<p>Click on the logic's name for a full description.</p>
<p><strong>Note:</strong>The listing below is currently incomplete. More will be added later.
</p>
<p class="footnote">[Logic declarations for Version 1.2 of SMT-LIB, superseded by the ones below, are still available <a href="version1/logics.html">here</a> but their use is deprecated.]
</p>
<dl>
<dt><a name="AUFLIA"/>
<a href="logics-all.shtml#AUFLIA">
<b>
AUFLIA:
</b>
</a>
</dt>
<dd>
Closed formulas over the theory of linear integer arithmetic and arrays
extended with free sort and function symbols
but restricted to arrays with integer indices and values.
</dd>
<dt><a name="AUFLIRA" />
<a href="logics-all.shtml#AUFLIRA">
<b>
AUFLIRA:
</b>
</a>
</dt>
<dd>
Closed linear formulas with free sort and function symbols
over one- and two-dimentional arrays of integer index and real value.
</dd>
<dt><a name="AUFNIRA" />
<a href="logics-all.shtml#AUFNIRA">
<b>
AUFNIRA:
</b>
</a>
</dt>
<dd>
Closed formulas with free function and predicate symbols
over a theory of arrays of arrays of integer index and real value.
</dd>
<dt><a name="LIA" />
<a href="logics-all.shtml#LIA">
<b>
LIA:
</b>
</a>
</dt>
<dd>
Closed linear formulas over linear integer arithmetic.
</dd>
<dt><a name="LRA" />
<a href="logics-all.shtml#LRA">
<b>
LRA:
</b>
</a>
</dt>
<dd>
Closed linear formulas in linear real arithmetic.
</dd>
<dt><a name="QF_ABV" />
<a href="logics-all.shtml#QF_ABV">
<b>
QF_ABV:
</b>
</a>
</dt>
<dd>
Closed quantifier-free formulas over the theory of bitvectors and bitvector arrays.
</dd>
<dt><a name="QF_AUFBV" />
<a href="logics-all.shtml#QF_AUFBV">
<b>
QF_AUFBV:
</b>
</a>
</dt>
<dd>
Closed quantifier-free formulas over the theory of bitvectors and bitvector arrays extended with free sort and function symbols.
</dd>
<dt><a name="QF_AUFLIA" />
<a href="logics-all.shtml#QF_AUFLIA">
<b>
QF_AUFLIA:
</b>
</a>
</dt>
<dd>
Closed quantifier-free linear formulas over the theory of integer arrays
extended with free sort and function symbols.
</dd>
<dt><a name="QF_AX" />
<a href="logics-all.shtml#QF_AX">
<b>
QF_AX:
</b>
</a>
</dt>
<dd>
Closed quantifier-free formulas over the theory of arrays with extensionality.
</dd>
<dt><a name="QF_BV" />
<a href="logics-all.shtml#QF_BV">
<b>
QF_BV:
</b>
</a>
</dt>
<dd>
Closed quantifier-free formulas over the theory of fixed-size bitvectors.
</dd>
<dt><a name="QF_IDL" />
<a href="logics-all.shtml#QF_IDL">
<b>
QF_IDL:
</b>
</a>
</dt>
<dd>
Difference Logic over the integers.
In essence,
Boolean combinations of inequations of the form <i>x - y < b</i>
where <i>x</i> and <i>y</i> are integer variables and <i>b</i> is an integer constant.
</dd>
<dt><a name="QF_LIA" />
<a href="logics-all.shtml#QF_LIA">
<b>
QF_LIA:
</b>
</a>
</dt>
<dd>
Unquantified linear integer arithmetic.
In essence,
Boolean combinations of inequations between
linear polynomials over integer variables.
</dd>
<dt><a name="QF_LRA" />
<a href="logics-all.shtml#QF_LRA">
<b>
QF_LRA:
</b>
</a>
</dt>
<dd>
Unquantified linear real arithmetic.
In essence,
Boolean combinations of inequations between linear polynomials
over real variables.
</dd>
<dt><a name="QF_NIA" />
<a href="logics-all.shtml#QF_NIA">
<b>
QF_NIA:
</b>
</a>
</dt>
<dd>
Quantifier-free integer arithmetic.
</dd>
<dt><a name="QF_NRA" />
<a href="logics-all.shtml#QF_NRA">
<b>
QF_NRA:
</b>
</a>
</dt>
<dd>
Quantifier-free real arithmetic.
</dd>
<dt><a name="QF_RDL" />
<a href="logics-all.shtml#QF_RDL">
<b>
QF_RDL:
</b>
</a>
</dt>
<dd>
Difference Logic over the reals.
In essence,
Boolean combinations of inequations of the form <i>x - y < b</i>
where <i>x</i> and <i>y</i> are real variables and <i>b</i> is a rational constant.
</dd>
<dt><a name="QF_UF" />
<a href="logics-all.shtml#QF_UF">
<b>
QF_UF:
</b>
</a>
</dt>
<dd>
Unquantified formulas built over a signature of uninterpreted (i.e., free) sort and function symbols.
</dd>
<dt><a name="QF_UFBV" />
<a href="logics-all.shtml#QF_UFBV">
<b>
QF_UFBV:
</b>
</a>
</dt>
<dd>
Unquantified formulas over bitvectors with uninterpreted sort function and symbols.
</dd>
<dt><a name="QF_UFIDL" />
<a href="logics-all.shtml#QF_UFIDL">
<b>
QF_UFIDL:
</b>
</a>
</dt>
<dd>
Difference Logic over the integers (in essence) but with uninterpreted sort and function symbols.
</dd>
<dt><a name="QF_UFLIA" />
<a href="logics-all.shtml#QF_UFLIA">
<b>
QF_UFLIA:
</b>
</a>
</dt>
<dd>
Unquantified linear integer arithmetic with uninterpreted sort and function symbols.
</dd>
<dt><a name="QF_UFLRA" />
<a href="logics-all.shtml#QF_UFLRA">
<b>
QF_UFLRA:
</b>
</a>
</dt>
<dd>
Unquantified linear real arithmetic with uninterpreted sort and function symbols.
</dd>
<dt><a name="QF_UFNRA" />
<a href="logics-all.shtml#QF_UFNRA">
<b>
QF_UFNRA:
</b>
</a>
</dt>
<dd>
Unquantified non-linear real arithmetic with uninterpreted sort and function symbols.
</dd>
<dt><a name="UFLRA" />
<a href="logics-all.shtml#UFLRA">
<b>
UFLRA:
</b>
</a>
</dt>
<dd>
Linear real arithmetic with uninterpreted sort and function symbols.
</dd>
<dt><a name="UFNIA" />
<a href="logics-all.shtml#UFNIA">
<b>
UFNIA:
</b>
</a>
</dt>
<dd>
Non-linear integer arithmetic with uninterpreted sort and function symbols.
</dd>
</dl>
<br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br><br>
</div>
<div class="sidebar">
<div class="gadget">
<ul class="sb_menu">
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li>Standard
<ul class="ex_menu">
<li><a href="language.shtml">Language</a>
<li><a href="theories.shtml">Theories</a>
<li><a href="logics.shtml">Logics</a>
<li><a href="examples.shtml">Examples</a>
</ul>
</li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li>Software
<ul class="ex_menu">
<li><a href="solvers.shtml">Solvers</a></li>
<li><a href="utilities.shtml">Utilities</a></li>
</ul>
</li>
<li><a href="contact.shtml">Contact</a></li>
<li><a href="related.shtml">Related</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
</div>
</div>
</div>
</div>
<div class="clr"></div>
<div class="footer">
<div class="footer_resize">
<p class="lf">
© Copyright The SMT-LIB Initiative <br>
Based on a design by
Blue <a href="http://www.bluewebtemplates.com">Web Templates</a>
</p>
<ul class="fmenu">
<li><a href="index.shtml">Home</a></li>
<li><a href="about.shtml">About</a></li>
<li><a href="news.shtml">News</a></li>
<li class="active"><a href="standard.shtml">Standard</a></li>
<li><a href="benchmarks.shtml">Benchmarks</a></li>
<li><a href="software.shtml">Software</a></li>
<li><a href="credits.shtml">Credits</a></li>
</ul>
<div class="clr"></div>
</div>
</div>
</div>
</body>
</html>