Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Anti-unification in Constraint Logic Programming   Anti-unification refers to the process of generalizing two (or more) goals
into a single, more general, goal that captures some of the structure that is
common to all initial goals. In general one is typically interested in
computing what is often called a most specific generalization, that is a
generalization that captures a maximal amount of shared structure. In this work
we address the problem of anti-unification in CLP, where goals can be seen as
unordered sets of atoms and/or constraints. We show that while the concept of a
most specific generalization can easily be defined in this context, computing
it becomes an NP-complete problem. We subsequently introduce a generalization
algorithm that computes a well-defined abstraction whose computation can be
bound to a polynomial execution time. Initial experiments show that even a
naive implementation of our algorithm produces acceptable generalizations in an
efficient way. Under consideration for acceptance in TPLP.

36
The categories of this paper are: cmp-lg
26
The categories of this paper are: bayes-an
6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
27
The categories of this paper are: comp-gas
29
The categories of this paper are: funct-an
2
The categories of this paper are: math
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
0
The categories of this paper are: hep-ph