<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<tt>[apologies for any cross-posting]<br>
<br>
</tt><tt><font size="3">******************************************************************************************<br>
QBFEVAL'18 - Competitive Evaluation of QBF Solvers<br>
A joint event with the 21st Int. Conference on Theory and
Applications of Satisfiability Testing (SAT)<br>
(affiliated with FLoC 2018)<br>
Oxford, UK, July 9 - July 12 2018<br>
******************************************************************************************<br>
<br>
<br>
QBFEVAL'18 is the 2018 competitive evaluation of QBF solvers,
and the thirteenth evaluation of QBF solvers and instances ever.
QBFEVAL'18 awards solvers that stand out as being particularly
effective on specific categories of QBF instances.<br>
<br>
We warmly encourage developers of QBF solvers to submit their
work, even at early stages of development, as long as it
fulfills some very simple requirements.<br>
<br>
We also welcome the submission of QBF formulas to be used for
the evaluation. Researchers thinking about using QBF-based
techniques in their area (e.g., formal verification, planning,
knowledge representation & reasoning) are invited to
contribute to the evaluation by submitting QBF instances of
their research problems (see the requirements for instances).
The results of the evaluation will be a good indicator of the
current feasibility of QBF-based approaches and a stimulus for
people working on QBF solvers to further enhance their tools.<br>
<br>
Details about solvers and benchmarks submission, tracks, and
related rules, are available at <a
class="moz-txt-link-freetext"
href="http://www.qbflib.org/qbfeval18.php">http://www.qbflib.org/qbfeval18.php</a><br>
<br>
For questions, comments and any other issue regarding
QBFEVAL'18, please get in touch with the organizers via <a
class="moz-txt-link-abbreviated"
href="mailto:qbf18@qbflib.org">qbf18@qbflib.org</a>.<br>
<br>
** Important Dates **<br>
<br>
- Registration open: March 14 (for all tracks)<br>
- Registration close: April 7<br>
- Solvers and Benchmarks due: April 14 (for all tracks except
Hard-Instances Track)<br>
- First stage results: April 30<br>
- Second stage solvers due: May 10 (for all tracks except
Hard-Instances Track)<br>
- Hard instances solver due: June 1<br>
- Competition Benchmarks available for download: June 14<br>
- Final results: presented at SAT'18 <br>
<br>
<br>
** Organizing committee **<br>
<br>
* Organization *<br>
Luca Pulina, University of Sassari<br>
Martina Seidl, Johannes Kepler Universitat Linz<br>
<br>
* Judges *<br>
Olaf Beyersdorff, University of Leeds<br>
Christoph Wintersteiger, Microsoft Research Limited<br>
<br>
</font><br>
<br>
</tt>
<p><br>
</p>
<pre class="moz-signature" cols="72">--
Luca Pulina, Ph.D.
Associate Professor of Computer Science
University of Sassari
Tel. +39 079 228987</pre>
</body>
</html>