کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4949570 1440194 2017 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Enumerating and categorizing positive Boolean functions separable by a k-additive capacity
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Enumerating and categorizing positive Boolean functions separable by a k-additive capacity
چکیده انگلیسی
Motivated by the elicitation or the learning of certain types of models for classifying objects in ordered categories based on several criteria, we categorize the positive Boolean functions up to 6 variables. We list all inequivalent positive Boolean functions and we determine the smallest degree k of the k-additive capacity that can be used for separating their true points from their false points. 1-additive Boolean functions are the well-studied threshold functions. Each function is described by its set of minimal true points. The latter correspond to the minimal winning coalitions of simple games. They also correspond to the minimal sufficient coalitions in the multiple criteria classification models we are interested in, namely, the MR-Sort and the noncompensatory sorting model.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 229, 1 October 2017, Pages 17-30
نویسندگان
, , , ,