Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Transformation-based Implementation for CLP with Qualification and
  Proximity   Uncertainty in logic programming has been widely investigated in the last
decades, leading to multiple extensions of the classical LP paradigm. However,
few of these are designed as extensions of the well-established and powerful
CLP scheme for Constraint Logic Programming. In a previous work we have
proposed the SQCLP (proximity-based qualified constraint logic programming)
scheme as a quite expressive extension of CLP with support for qualification
values and proximity relations as generalizations of uncertainty values and
similarity relations, respectively. In this paper we provide a transformation
technique for transforming SQCLP programs and goals into semantically
equivalent CLP programs and goals, and a practical Prolog-based implementation
of some particularly useful instances of the SQCLP scheme. We also illustrate,
by showing some simple-and working-examples, how the prototype can be
effectively used as a tool for solving problems where qualification values and
proximity relations play a key role. Intended use of SQCLP includes flexible
information retrieval applications.

13
The categories of this paper are: quant-ph
24
The categories of this paper are: dg-ga
2
The categories of this paper are: math
26
The categories of this paper are: bayes-an
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
23
The categories of this paper are: solv-int
7
The categories of this paper are: hep-th
25
The categories of this paper are: patt-sol
20
The categories of this paper are: acc-phys
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
12
The categories of this paper are: nucl-th
32
The categories of this paper are: atom-ph
27
The categories of this paper are: comp-gas
36
The categories of this paper are: cmp-lg