Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Decision Procedure for String Logic with Equations, Regular Membership
  and Length Constraints   In this paper, we consider the satisfiability problem for string logic with
equations, regular membership and Presburger constraints over length functions.
The difficulty comes from multiple occurrences of string variables making
state-of-the-art algorithms non-terminating. Our main contribution is to show
that the satisfiability problem in a fragment where no string variable occurs
more than twice in an equation is decidable. In particular, we propose a
semi-decision procedure for arbitrary string formulae with word equations,
regular membership and length functions. The essence of our procedure is an
algorithm to enumerate an equivalent set of solvable disjuncts for the formula.
We further show that the algorithm always terminates for the aforementioned
decidable fragment. Finally, we provide a complexity analysis of our decision
procedure to prove that it runs, in the worst case, in factorial time.

6
The categories of this paper are: astro-ph
5
The categories of this paper are: gr-qc
34
The categories of this paper are: chem-ph
10
The categories of this paper are: q-bio
17
The categories of this paper are: q-fin
28
The categories of this paper are: alg-geom
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
2
The categories of this paper are: math
29
The categories of this paper are: funct-an
26
The categories of this paper are: bayes-an
30
The categories of this paper are: q-alg
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex