Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: SAT Solving for Argument Filterings   This paper introduces a propositional encoding for lexicographic path orders
in connection with dependency pairs. This facilitates the application of SAT
solvers for termination analysis of term rewrite systems based on the
dependency pair method. We address two main inter-related issues and encode
them as satisfiability problems of propositional formulas that can be
efficiently handled by SAT solving: (1) the combined search for a lexicographic
path order together with an \emph{argument filtering} to orient a set of
inequalities; and (2) how the choice of the argument filtering influences the
set of inequalities that have to be oriented. We have implemented our
contributions in the termination prover AProVE. Extensive experiments show that
by our encoding and the application of SAT solvers one obtains speedups in
orders of magnitude as well as increased termination proving power.

14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
34
The categories of this paper are: chem-ph
31
The categories of this paper are: ao-sci
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
30
The categories of this paper are: q-alg
25
The categories of this paper are: patt-sol
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th