Bounded Bases of Strong Partial Clones - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Bounded Bases of Strong Partial Clones

Résumé

Partial clone theory has successfully been applied to study the complexity of the constraint satisfaction problem parameterized by a set of relations (CSP(Γ)). Lagerkvist & Wahlström (ISMVL 2014) however shows that the partial polymorphisms of Γ (pPol(Γ)) 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 pPol(Γ) 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-ink SAT .
Fichier principal
Vignette du fichier
Lagerkvist.ISMVL.2015.pdf (459.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01196687 , version 1 (10-09-2015)

Identifiants

Citer

Victor Lagerkvist, Magnus Wahlström, Bruno Zanuttini. Bounded Bases of Strong Partial Clones. 45th International Symposium on Multiple-Valued Logic (ISMVL 2015), May 2015, Waterloo, Canada. ⟨10.1109/ISMVL.2015.33⟩. ⟨hal-01196687⟩
108 Consultations
92 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More