论文信息 - Bounded Bases of Strong Partial Clones

Bounded Bases of Strong Partial Clones

Partial clone theory has successfully been applied to study the complexity of the constraint satisfaction problem parameterized by a set of relations (CSP(Γ)). Lagerkvist & Wahlström (ISMVL 2014) however shows that the partial polymorphisms of Γ (ρPοI(Γ)) cannot be finitely generated for finite, Boolean Γ if CSP(Γ) is NP-hard (assuming P≠NP). In this paper we consider stronger closure operators than functional composition which can generate ρPοI(Γ) from a finite set of partial functions, a bounded base. Determining bounded bases for finite languages provides a complete characterization of their partial polymorphisms and we provide such bases for k-SAT and 1-in-k-SAT.

Magnus Wahlström | Bruno Zanuttini | Victor Lagerkvist

[1] Magnus Wahlström,et al. Polynomially Closed Co-clones , 2014, 2014 IEEE 44th International Symposium on Multiple-Valued Logic.

[2] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[3] L. A. Kaluzhnin,et al. Galois theory for post algebras. I , 1969 .

[4] Victor Lagerkvist. Weak bases of Boolean co-clones , 2014, Inf. Process. Lett..

[5] Gustav Nordh,et al. Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis , 2013, SODA.

[6] Ilka Schnoor. The weak base method for constraint satisfaction , 2008 .

[7] B. A. Romov. The algebras of partial functions and their invariants , 1981 .

[8] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .

[9] V. B. ALEKSEEV,et al. On some closed classes in partial two-valued logic , 1994 .

[10] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.