Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Unification Algorithm for GP 2 (Long Version)   The graph programming language GP 2 allows to apply sets of rule schemata (or
"attributed" rules) non-deterministically. To analyse conflicts of programs
statically, graphs labelled with expressions are overlayed to construct
critical pairs of rule applications. Each overlay induces a system of equations
whose solutions represent different conflicts. We present a rule-based
unification algorithm for GP expressions that is terminating, sound and
complete. For every input equation, the algorithm generates a finite set of
substitutions. Soundness means that each of these substitutions solves the
input equation. Since GP labels are lists constructed by concatenation,
unification modulo associativity and unit law is required. This problem, which
is also known as word unification, is infinitary in general but becomes
finitary due to GP's rule schema syntax and the assumption that rule schemata
are left-linear. Our unification algorithm is complete in that every solution
of an input equation is an instance of some substitution in the generated set.

27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
23
The categories of this paper are: solv-int
19
The categories of this paper are: eess
36
The categories of this paper are: cmp-lg
22
The categories of this paper are: chao-dyn
10
The categories of this paper are: q-bio
28
The categories of this paper are: alg-geom
21
The categories of this paper are: adap-org
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
17
The categories of this paper are: q-fin