Premium
Recursive connective rules
Author(s) -
Cutello Vincenzo,
Montero Javier
Publication year - 1999
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/(sici)1098-111x(199901)14:1<3::aid-int2>3.0.co;2-k
Subject(s) - binary number , associative property , sequence (biology) , computer science , process (computing) , binary operation , algorithm , theoretical computer science , algebra over a field , mathematics , artificial intelligence , arithmetic , discrete mathematics , pure mathematics , programming language , genetics , biology
An associative binary connective allows the evaluation of arbitrary finite sequences of items by means of a one‐by‐one sequential process. In this paper we develop an alternative approach for those nonassociative connectives, allowing a sequential definition by means of binary fuzzy connectives. It will be then stressed that a connective rule should be understood as a consistent sequence of binary connective operators. ©1999 John Wiley & Sons, Inc.