Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Mining to Compact CNF Propositional Formulae   In this paper, we propose a first application of data mining techniques to
propositional satisfiability. Our proposed Mining4SAT approach aims to discover
and to exploit hidden structural knowledge for reducing the size of
propositional formulae in conjunctive normal form (CNF). Mining4SAT combines
both frequent itemset mining techniques and Tseitin's encoding for a compact
representation of CNF formulae. The experiments of our Mining4SAT approach show
interesting reductions of the sizes of many application instances taken from
the last SAT competitions.

13
The categories of this paper are: quant-ph
29
The categories of this paper are: funct-an
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
23
The categories of this paper are: solv-int
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci