{"title":"关于有界格子上的制服类Umin和Umax","authors":"Ya-Ming Wang , Yexing Dan , Bernard De Baets","doi":"10.1016/j.ijar.2026.109627","DOIUrl":null,"url":null,"abstract":"<div><div>Recently, the concept of a uninorm on a bounded lattice has been generalized to bounded trellises. A fundamental distinction between lattices and trellises lies in the fact that the underlying pseudo-order relation of a trellis does not need to be transitive. In this paper, we undertake an in-depth dissection of certain types of uninorms on bounded trellises, both from a construction and a characterization point of view. We begin by introducing the uninorms in the classes <span><math><msub><mi>U</mi><mi>min</mi></msub></math></span> and <span><math><msub><mi>U</mi><mi>max</mi></msub></math></span> on a bounded trellis and provide necessary and sufficient conditions for their characterization. Subsequently, we present two approaches for constructing uninorms on a bounded trellis by utilizing a uninorm defined on a closed subinterval of that bounded trellis. It is shown that these approaches yield uninorms on a bounded trellis that not only differ from the ones obtainable through existing methods, but also generalize those on a bounded lattice constructed via a uninorm defined on a closed subinterval of that bounded lattice.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"191 ","pages":"Article 109627"},"PeriodicalIF":2.8000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the classes of uninorms Umin and Umax on bounded trellises\",\"authors\":\"Ya-Ming Wang , Yexing Dan , Bernard De Baets\",\"doi\":\"10.1016/j.ijar.2026.109627\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Recently, the concept of a uninorm on a bounded lattice has been generalized to bounded trellises. A fundamental distinction between lattices and trellises lies in the fact that the underlying pseudo-order relation of a trellis does not need to be transitive. In this paper, we undertake an in-depth dissection of certain types of uninorms on bounded trellises, both from a construction and a characterization point of view. We begin by introducing the uninorms in the classes <span><math><msub><mi>U</mi><mi>min</mi></msub></math></span> and <span><math><msub><mi>U</mi><mi>max</mi></msub></math></span> on a bounded trellis and provide necessary and sufficient conditions for their characterization. Subsequently, we present two approaches for constructing uninorms on a bounded trellis by utilizing a uninorm defined on a closed subinterval of that bounded trellis. It is shown that these approaches yield uninorms on a bounded trellis that not only differ from the ones obtainable through existing methods, but also generalize those on a bounded lattice constructed via a uninorm defined on a closed subinterval of that bounded lattice.</div></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"191 \",\"pages\":\"Article 109627\"},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2026-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Approximate Reasoning\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0888613X26000034\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2026/1/9 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Approximate Reasoning","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0888613X26000034","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/1/9 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
On the classes of uninorms Umin and Umax on bounded trellises
Recently, the concept of a uninorm on a bounded lattice has been generalized to bounded trellises. A fundamental distinction between lattices and trellises lies in the fact that the underlying pseudo-order relation of a trellis does not need to be transitive. In this paper, we undertake an in-depth dissection of certain types of uninorms on bounded trellises, both from a construction and a characterization point of view. We begin by introducing the uninorms in the classes and on a bounded trellis and provide necessary and sufficient conditions for their characterization. Subsequently, we present two approaches for constructing uninorms on a bounded trellis by utilizing a uninorm defined on a closed subinterval of that bounded trellis. It is shown that these approaches yield uninorms on a bounded trellis that not only differ from the ones obtainable through existing methods, but also generalize those on a bounded lattice constructed via a uninorm defined on a closed subinterval of that bounded lattice.
期刊介绍:
The International Journal of Approximate Reasoning is intended to serve as a forum for the treatment of imprecision and uncertainty in Artificial and Computational Intelligence, covering both the foundations of uncertainty theories, and the design of intelligent systems for scientific and engineering applications. It publishes high-quality research papers describing theoretical developments or innovative applications, as well as review articles on topics of general interest.
Relevant topics include, but are not limited to, probabilistic reasoning and Bayesian networks, imprecise probabilities, random sets, belief functions (Dempster-Shafer theory), possibility theory, fuzzy sets, rough sets, decision theory, non-additive measures and integrals, qualitative reasoning about uncertainty, comparative probability orderings, game-theoretic probability, default reasoning, nonstandard logics, argumentation systems, inconsistency tolerant reasoning, elicitation techniques, philosophical foundations and psychological models of uncertain reasoning.
Domains of application for uncertain reasoning systems include risk analysis and assessment, information retrieval and database design, information fusion, machine learning, data and web mining, computer vision, image and signal processing, intelligent data analysis, statistics, multi-agent systems, etc.