Abstract
In this paper, we provide normal forms and truth tables for interval-valued fuzzy logic which are analogous to those for classical logic, i.e. analogous to the disjunctive and conjunctive normal forms and truth tables for Boolean algebras. We give an algorithm for rewriting an expression to obtain its disjunctive normal form. We also give an algorithm for obtaining the disjunctive normal form of an expression from its table of truth values.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
