On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations

Résumé

A strong partial clone is a set of partial operations closed under composition and containing all partial projections. Let X be the set of all Boolean strong partial clones whose total operations are the projections. This set is of practical interest since it induces a partial order on the complexity of NP-complete constraint satisfaction problems. In this paper we study X from the algebraic point of view, and prove that there exists two intervals in X , corresponding to natural constraint satisfaction problems, such that one is at least countably infinite and the other has the cardinality of the continuum.
Fichier principal
Vignette du fichier
maximal_partial_subclones_revised(4).pdf (308.65 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01504012 , version 1 (08-04-2017)

Identifiants

  • HAL Id : hal-01504012 , version 1

Citer

Miguel Couceiro, Lucien Haddad, Victor Lagerkvist, Biman Roy. On the Interval of Boolean Strong Partial Clones Containing Only Projections as Total Operations. 47th IEEE International Symposium on Multiple-Valued Logic (ISMVL), May 2017, Novi Sad, Serbia. ⟨hal-01504012⟩
462 Consultations
106 Téléchargements

Partager

Gmail Facebook X LinkedIn More