Similarity mass and approximate reasoning

Ya-lin Zheng (), Bing-yuan Cao (), Guang Yang and Yong-cheng Bai
Additional contact information
Ya-lin Zheng: Dongguan University of Science and Technology
Bing-yuan Cao: Guangzhou University, Guangzhou Higher Education Mega Center
Guang Yang: Dongguan University of Science and Technology
Yong-cheng Bai: Shanxi University of Science and Technology

Fuzzy Information and Engineering, 2009, vol. 1, issue 1, 91-101

Abstract: Abstract It can reflect the nature of approximate reasoning and meet more application expectations to design the approximate reasoning matching schemes and the corresponding algorithms with similarity relation Q instead of equivalence relation R. In this paper, based on similarity relation Q, we introduce type V matching scheme and corresponding approximate reasoning type V Q-algorithm with the given input A* and knowledge A → B. Besides, we present completeness of type V and its perfection on knowledge base K in Q-logic ℂ Q in this paper.

Keywords: Approximate reasoning; Formula mass; Knowledge mass; Q-logic; Q-algorithm; Q-completeness (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12543-009-0007-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:fuzinf:v:1:y:2009:i:1:d:10.1007_s12543-009-0007-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/12543

DOI: 10.1007/s12543-009-0007-z

Access Statistics for this article

More articles in Fuzzy Information and Engineering from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().