Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Resolution Trees with Lemmas: Resolution Refinements that Characterize
  DLL Algorithms with Clause Learning   Resolution refinements called w-resolution trees with lemmas (WRTL) and with
input lemmas (WRTI) are introduced. Dag-like resolution is equivalent to both
WRTL and WRTI when there is no regularity condition. For regular proofs, an
exponential separation between regular dag-like resolution and both regular
WRTL and regular WRTI is given.
  It is proved that DLL proof search algorithms that use clause learning based
on unit propagation can be polynomially simulated by regular WRTI. More
generally, non-greedy DLL algorithms with learning by unit propagation are
equivalent to regular WRTI. A general form of clause learning, called
DLL-Learn, is defined that is equivalent to regular WRTL.
  A variable extension method is used to give simulations of resolution by
regular WRTI, using a simplified form of proof trace extensions. DLL-Learn and
non-greedy DLL algorithms with learning by unit propagation can use variable
extensions to simulate general resolution without doing restarts.
  Finally, an exponential lower bound for WRTL where the lemmas are restricted
to short clauses is shown.

15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
16
The categories of this paper are: stat
17
The categories of this paper are: q-fin
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
5
The categories of this paper are: gr-qc
26
The categories of this paper are: bayes-an
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
29
The categories of this paper are: funct-an
37
The categories of this paper are: supr-con
30
The categories of this paper are: q-alg