.png){kind=icon}
返回
Fuzzy logic programming reduced to reasoning with attribute implications
.png){kind=icon}
PRE
AI
DOI：10.1016/j.fss.2014.04.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a link between two types of logic systems for reasoning with graded if then rules: the system of fuzzy logic programming (FLP) in sense of Vojta and the system of fuzzy attribute logic (FAL) in sense of Belohlavek and Vychodil. We show that each finite theory consisting of formulas of FAL can be represented by a definite program so that the semantic entailment in FAL can be characterized by correct answers for the program. Conversely, we show that for each definite program there is a collection of formulas of FAL so that the correct answers can be represented by the entailment in FAL. Using the link, we can transport results from FAL to FLP and vice versa which gives us, e.g., a syntactic characterization of correct answers based on Pavelka-style Armstrong-like axiomatization of FAL. We further show that entailment in FLP is reducible to reasoning with Boolean attribute implications and elaborate on related issues including properties of least models.
Keyword:
Logic programming
Attribute implications
Functional dependencies
Ordinal scales
Residuated lattices
Least model property
期刊
IF:
2.7
论文数:
7.6K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏
查看更多内容