{"title":"用格积分变换逼近格值函数","authors":"Viec Bui Quoc , Michal Holčapek","doi":"10.1016/j.ijar.2025.109476","DOIUrl":null,"url":null,"abstract":"<div><div>This paper examines the approximation capabilities of lattice integral transforms and their compositions in reconstructing lattice-valued functions. By introducing an integral kernel <em>Q</em> on the function domain, we define the concept of a <em>Q</em>-inverse integral kernel, which generalizes the traditional inverse kernel defined as a transposed integral kernel. Leveraging these <em>Q</em>-inverses, we establish upper and lower bounds for a transformed version of the original function induced by the integral kernel <em>Q</em>. The quality of approximation is analyzed using a lattice-based modulus of continuity, specifically designed for functions valued in complete residuated lattices. Additionally, under specific conditions, we demonstrate that the approximation quality for extensional functions with respect to the kernel <em>Q</em> can be estimated through the integral of the square of <em>Q</em>, and in certain cases, these extensional functions can be perfectly reconstructed. The theoretical findings, illustrated through examples, provide a strong foundation for further theoretical advancement and practical applications.</div></div>","PeriodicalId":13842,"journal":{"name":"International Journal of Approximate Reasoning","volume":"185 ","pages":"Article 109476"},"PeriodicalIF":3.0000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On approximation of lattice-valued functions using lattice integral transforms\",\"authors\":\"Viec Bui Quoc , Michal Holčapek\",\"doi\":\"10.1016/j.ijar.2025.109476\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This paper examines the approximation capabilities of lattice integral transforms and their compositions in reconstructing lattice-valued functions. By introducing an integral kernel <em>Q</em> on the function domain, we define the concept of a <em>Q</em>-inverse integral kernel, which generalizes the traditional inverse kernel defined as a transposed integral kernel. Leveraging these <em>Q</em>-inverses, we establish upper and lower bounds for a transformed version of the original function induced by the integral kernel <em>Q</em>. The quality of approximation is analyzed using a lattice-based modulus of continuity, specifically designed for functions valued in complete residuated lattices. Additionally, under specific conditions, we demonstrate that the approximation quality for extensional functions with respect to the kernel <em>Q</em> can be estimated through the integral of the square of <em>Q</em>, and in certain cases, these extensional functions can be perfectly reconstructed. The theoretical findings, illustrated through examples, provide a strong foundation for further theoretical advancement and practical applications.</div></div>\",\"PeriodicalId\":13842,\"journal\":{\"name\":\"International Journal of Approximate Reasoning\",\"volume\":\"185 \",\"pages\":\"Article 109476\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2025-05-22\",\"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/S0888613X25001173\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"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/S0888613X25001173","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
On approximation of lattice-valued functions using lattice integral transforms
This paper examines the approximation capabilities of lattice integral transforms and their compositions in reconstructing lattice-valued functions. By introducing an integral kernel Q on the function domain, we define the concept of a Q-inverse integral kernel, which generalizes the traditional inverse kernel defined as a transposed integral kernel. Leveraging these Q-inverses, we establish upper and lower bounds for a transformed version of the original function induced by the integral kernel Q. The quality of approximation is analyzed using a lattice-based modulus of continuity, specifically designed for functions valued in complete residuated lattices. Additionally, under specific conditions, we demonstrate that the approximation quality for extensional functions with respect to the kernel Q can be estimated through the integral of the square of Q, and in certain cases, these extensional functions can be perfectly reconstructed. The theoretical findings, illustrated through examples, provide a strong foundation for further theoretical advancement and practical applications.
期刊介绍:
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.