A complete classification of equational classes of threshold functions included in clones

Abstract : The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by a finite number of such objects. In this paper, we investigate classes of threshold functions which arise as intersections of the class of all threshold functions with clones of Boolean functions, and provide a complete classification of such intersections in respect to whether they have finite characterizations. Moreover, we provide a characterizing set of relational constraints for each class of threshold functions arising in this way.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01090621
Contributor : Miguel Couceiro <>
Submitted on : Saturday, February 18, 2017 - 3:20:18 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:02 PM
Long-term archiving on : Friday, May 19, 2017 - 2:54:39 PM

File

ThresholdClassification.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Miguel Couceiro, Erkko Lehtonen, Karsten Schölzel. A complete classification of equational classes of threshold functions included in clones. RAIRO - Operations Research, EDP Sciences, 2015, 49 (1), pp.39-66. ⟨10.1051/ro/2014034 ⟩. ⟨hal-01090621⟩

Share

Metrics

Record views

439

Files downloads

171