We prove that the sharply bounded arithmetic T 0 2 in a language containing the function symbol ⌊ x 2y ⌋ (often denoted by MSP) is equivalent to PV1.

We define a number of original encodings that map MaxCSP instances into partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into SAT. Then, we report on an experimental investigation that was conducted to compare the performance profile of our encodings on random binary Max-CSP instances. Moreover, we define a new variant of the support encoding...

The MAX-LABEL-COVER(K,L) Problem: An instance to the MAX-LABEL-COVER(K,L) problem comprises of a bipartite graph G(U, V, E) with U and V being the two partitions, and a projection function πv→u : L → K on each edge (u, v). The objective is to obtain a labeling of the vertices (a function f : U → K, V → L) which satisfies maximum fraction of the edges. Edge (u, v) is satisfied by labeling f if a...