Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Integrating Cardinality Constraints into Constraint Logic Programming
  with Sets   Formal reasoning about finite sets and cardinality is an important tool for
many applications, including software verification, where very often one needs
to reason about the size of a given data structure and not only about what its
elements are. The Constraint Logic Programming tool {log} provides a decision
procedure for deciding the satisfiability of formulas involving very general
forms of finite sets, without cardinality. In this paper we adapt and integrate
a decision procedure for a theory of finite sets with cardinality into {log}.
The proposed solver is proved to be a decision procedure for its formulas.
Besides, the new CLP instance is implemented as part of the {log} tool. In
turn, the implementation uses Howe and King's Prolog SAT solver and Prolog's
CLP(Q) library, as an integer linear programming solver. The empirical
evaluation of this implementation based on +250 real verification conditions
shows that it can be useful in practice.

37
The categories of this paper are: supr-con
11
The categories of this paper are: hep-lat
18
The categories of this paper are: econ
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
6
The categories of this paper are: astro-ph
13
The categories of this paper are: quant-ph
4
The categories of this paper are: cond-mat