In this chapter the algebraic relations between conventional Boolean logic, finite-valued logic and continuous-valued logic are discussed and a proper mathematical framework is defined. Within that framework we study how algorithms originally devised to cope with switching circuits can be used to process the natural language statements which define a fuzzy rule-based model, demonstrating that the human manipulations of alternatives with similar consequences and of exceptional cases can be partially but effectively automated.
|Microelectronics Group Home Page||Staff|
|Research Activities||Teaching Activity|
|DEIS Home Page||University of Bologna Home Page|