Abstract
In recent years, the use of t-norms is increasing on several areas of Soft Computing, as well as the ordinal sum of t-norms, which is used to construct other t-norms. In this paper, given a family of pairwise disjoint subintervals of a bounded lattice, we present a characterization of the ordinal sum on the lattice being always a t-norm, for any arbitrary family of t-norms on these subintervals. As a consequence, we provide a direct tool to verify if these ordinal sums are or are not t-norms. Moreover, we can easily construct t-norms from ordinal sums of t-norms and recognize the structure of the bounded lattices considered.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
