-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathindex.html
88 lines (80 loc) · 3.01 KB
/
index.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
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>SAT Competition 2020</title>
<link rel="stylesheet" href="main.css" type="text/css">
<link rel="icon" type="image/x-icon" href="doge2.ico">
<script src="https://www.w3schools.com/lib/w3.js"></script>
<style>a#index { color:#c20114; }</style>
</head>
<body>
<div class="main">
<div class="navigation" w3-include-html="navigation.html"></div>
<script>w3.includeHTML();</script>
<div class="content">
<h1>SAT Competition 2020</h1>
<h3>
Affiliated with the
<a href="https://sat2020.idea-researchlab.org/">23rd International Conference on Theory and Applications of Satisfiability Testing</a>
taking place on the 5th - 9th of July 2020 in Alghero, Italy.
</h3>
<p>
The 2020 SAT Competition is a competitive event for solvers of the Boolean Satisfiability (SAT) problem.
It is organized as a satellite event to the
<a href="https://sat2020.idea-researchlab.org/">23rd International Conference on Theory and Applications of Satisfiability Testing</a>
and stands in the tradition of the yearly <a href="http://www.satcompetition.org">SAT Competitions and SAT-Races / Challenges</a>.
</p>
<h3><a name="Objective">Objective</a></h3>
<p>
The area of SAT Solving has seen tremendous progress over the last years.
Many problems (e.g. in hardware and software verification) that seemed to be completely out of reach a decade ago can now be handled routinely.
Besides new algorithms and better heuristics, refined implementation techniques turned out to be vital for this success.
</p>
<p>
To keep up the driving force in improving SAT solvers, we want to motivate implementors to present their work to a broader audience and to compare it with that of others.
</p>
<h3><a name="Tracks">Tracks</a></h3>
<p>
SAT Competition 2020 will consist of the following tracks*:
</p>
<ul>
<li>Main Track
<ul>
<li>with Glucose-Hack Award</li>
<li>with No-Limits Subtrack</li>
<li>with Planning Subtrack <sup style='color:#c20114'>new</sup></li>
</ul>
</li>
<li>Incremental Library Track</li>
<li>Parallel Track</li>
<li>Cloud Track <sup style='color:#c20114'>new</sup></li>
</ul>
<p>* Tracks with less than 3 participants will be canceled.</p>
<h3>Important Dates</h3>
<table>
<tr>
<td>Registration Opens:</td>
<td class="date">March 1</td>
</tr>
<tr>
<td>Benchmark Submission Deadline</td>
<td class="date"><strike>March 31</strike> May 1</td>
</tr>
<tr>
<td>Solver Submission Deadline:</td>
<td class="date"><strike>March 31</strike> May 1</td>
</tr>
<tr>
<td>Announcement of Results:</td>
<td>At the <a href="https://sat2020.idea-researchlab.org/">SAT'20 Conference</a></td>
</tr>
</table>
<h3><a name="Organization">Organization</a></h3>
<p>
Researchers from both academia and industry are invited to submit their solvers and benchmarks to SAT Competition 2020.
</p>
</div>
</div>
</body>
</html>