Skip to main content
Proceedings of The International Symposium on Multiple-Valued Logic2024, Pages 13-1854th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2024; Masaryk UniversityBrno; Czech Republic; 28 May 2024 through 30 May 2024; Category numberCFP24034-ART; Code 202024

Relational Characterization of Multilevel Threshold Functions(Conference Paper)

  • Durdevic, A.,
  • Pantovic, J.
  Save all to author list
  • University of Novi Sad, Faculty of Technical Sciences, Novi Sad, Serbia

Abstract

It is well-known that the set of Boolean threshold functions can be characterized by pairs of relations called relational constraints. In this paper, we extend this characterization to encompass multilevel threshold functions using the framework of relational constraints. Specifically, we define a countably infinite set of pairs of relations that succinctly captures the set of multilevel threshold functions. For each pair of relations, our approach ensures that when a multilevel threshold function is applied to rows of any matrix, with its columns drawn from the first relation, the resulting output corresponds to an element from the second relation. © 2024 IEEE.

Author keywords

clonesrelational characterizationthreshold functions

Indexed keywords

Engineering uncontrolled termsClonematrixMultilevelsRelational characterizationRelational constraintThreshold functions
Engineering main heading:Boolean functions

Funding details

Funding sponsor Funding number Acronym
Science Fund of the Republic of Serbia6458932
451-03-65/2024- 03/200156
01-3394/1

  • 1

    This research has been supported by the Science Fund of the Republic of Serbia (project \u201CALADDIN\u201D, no. SFRS#6458932) and Ministry of Science, Technology Development and Innovation (Contract No. 451-03-65/2024- 03/200156) and the Faculty of Technical Sciences, University of Novi Sad through project \u201CScientific and Artistic Research Work of Researchers in Teaching and Associate Positions at the Faculty of Technical Sciences, University of Novi Sad\u201D (No. 01-3394/1). We thank the anonymous referees for their valuable comments, which significantly enhanced the previous version of the manuscript.

  • ISSN: 0195623X
  • ISBN: 979-835034308-3
  • CODEN: PSMLD
  • Source Type: Conference Proceeding
  • Original language: English
  • DOI: 10.1109/ISMVL60454.2024.00013
  • Document Type: Conference Paper
  • Sponsors: Brno Observatory and Planetarium,IEEE,IEEE Computer Society,IEEE Technical Community on Multiple-Valued Logic (TCMVL)
  • Publisher: IEEE Computer Society


© Copyright 2024 Elsevier B.V., All rights reserved.

Cited by 0 documents

Inform me when this document is cited in Scopus:
Set citation alert Set citation feed
{"topic":{"name":"Constraint Satisfaction Problems; Polynomial Approximation; Computational Complexity","id":9026,"uri":"Topic/9026","prominencePercentile":66.45419,"prominencePercentileString":"66.454","overallScholarlyOutput":0},"dig":"3c5a1a52db383f0a2e028eb94ad649695c7c94ffe8e00e459b3d8857d31c7963"}

SciVal Topic Prominence

Topic:
Prominence percentile: