Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Subsumption Algorithms for Three-Valued Geometric Resolution   In our implementation of geometric resolution, the most costly operation is
subsumption testing (or matching): One has to decide for a three-valued,
geometric formula, if this formula is false in a given interpretation. The
formula contains only atoms with variables, equality, and existential
quantifiers. The interpretation contains only atoms with constants. Because the
atoms have no term structure, matching for geometric resolution is hard. We
translate the matching problem into a generalized constraint satisfaction
problem, and discuss several approaches for solving it efficiently, one direct
algorithm and two translations to propositional SAT. After that, we study
filtering techniques based on local consistency checking. Such filtering
techniques can a priori refute a large percentage of generalized constraint
satisfaction problems. Finally, we adapt the matching algorithms in such a way
that they find solutions that use a minimal subset of the interpretation. The
adaptation can be combined with every matching algorithm. The techniques
presented in this paper may have applications in constraint solving independent
of geometric resolution.

36
The categories of this paper are: cmp-lg
10
The categories of this paper are: q-bio
33
The categories of this paper are: plasm-ph
26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
17
The categories of this paper are: q-fin
19
The categories of this paper are: eess
32
The categories of this paper are: atom-ph
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
31
The categories of this paper are: ao-sci