Parameterized Simplification Logic: Reasoning With Implications in an Automated Way
IEEE Transactions on Fuzzy Systems（2022）
摘要
In this sequel to our previous article (Cordero
et al.
, 2020) on general inference systems for reasoning with if–then dependencies, we study transformations of if–then rules to semantically equivalent collections of if–then rules suitable to solve several problems related to reasoning with data dependencies. We work in a framework of general lattice-based if–then rules whose semantics is parameterized by systems of isotone Galois connections. This framework allows us to obtain theoretical insight as well as algorithms on a general level and observe their special cases by choosing various types of parameterizations. This way, we study methods for automated reasoning with different types of if–then rules in a single framework that covers existing as well as novel types of rules. Our approach supports a large family of if–then rules, including fuzzy if–then rules with various types of semantics. The main results in this article include new observations on the syntactic inference of if–then rules, complete collections of rules, reduced normal forms of collections of rules, and automated reasoning methods. We demonstrate the generality of the framework and the results by examples of their particular cases focusing on fuzzy if–then rules.
更多查看译文
关键词
Approximate reasoning,completeness,data dependency,lattice theory,closure operator,fuzzy if–then rules
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要