Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Automated Benchmarking of Incremental SAT and QBF Solvers   Incremental SAT and QBF solving potentially yields improvements when
sequences of related formulas are solved. An incremental application is usually
tailored towards some specific solver and decomposes a problem into incremental
solver calls. This hinders the independent comparison of different solvers,
particularly when the application program is not available. As a remedy, we
present an approach to automated benchmarking of incremental SAT and QBF
solvers. Given a collection of formulas in (Q)DIMACS format generated
incrementally by an application program, our approach automatically translates
the formulas into instructions to import and solve a formula by an incremental
SAT/QBF solver. The result of the translation is a program which replays the
incremental solver calls and thus allows to evaluate incremental solvers
independently from the application program. We illustrate our approach by
different hardware verification problems for SAT and QBF solvers.

6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
21
The categories of this paper are: adap-org
2
The categories of this paper are: math
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
15
The categories of this paper are: nucl-ex