Reference : Sur des classes de fonctions à seuil caractérisables par des contraintes relationnelles
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
Business & economic sciences : Quantitative methods in economics & management
http://hdl.handle.net/10993/11568
Sur des classes de fonctions à seuil caractérisables par des contraintes relationnelles
English
[en] On classes of threshold functions characterizable by relational constraints
Couceiro, Miguel mailto [Université Paris Dauphine > LAMSADE]
Lehtonen, Erkko mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Schölzel, Karsten mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Oct-2013
Actes des 22èmes rencontres francophones sur la Logique Floue et ses Applications, 10-11 octobre 2013, Reims, France
Marichal, Jean-Luc mailto
Essounbouli, Najib
Guelton, Kevin
Université de Reims Champagne-Ardenne
145-152
Yes
No
International
Rencontres francophones sur la logique floue et ses applications 2013 (LFA 2013)
from 10-10-2013 to 11-10-2013
Najib Essounbouli (co-président du comité d’organisation)
Kevin Guelton (co-président du comité d’organisation)
Jean-Luc Marichal (président du comité de programme)
Reims
France
[en] Boolean function ; relational constraint ; functional equation ; threshold function ; clone ; characterization ; fonction à seuil ; clone ; caractérisation
[fr] Fonction booléenne ; contrainte relationnelle ; équation fonctionnelle
[en] Motivated by modal semantics induced by majority games, we consider the class of threshold functions. It was shown by L. Hellerstein that this class is characterizable by relational constraints (or equivalently, by functional equations), but that there is no characterization by means of finitely many constraints. In this paper, we present a complete classification of classes of threshold functions induced by Boolean clones, into whether they are characterizable by finitely many relational constraints. Moreover we provide sets of constraints characterizing each of such classes.
University of Luxembourg - UL
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/11568
http://www.univ-reims.fr/lfa2013

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
lfa2013_10.pdfPublisher postprint485.07 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.