English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62822/95882 (66%)
造访人次 : 4016331      在线人数 : 556
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45505


    题名: A resolution-based system for symblic approximate reasoning
    作者: 鍾興臺;Chung, Hsing-tai;Schwartz, Daniel G.
    贡献者: 淡江大學資訊工程學系
    关键词: approximate reasoning;fuzzy expert systems;fuzzy inference;resolution methods;symbolic approximate reasoning
    日期: 1995-10-01
    上传时间: 2010-03-26 19:26:07 (UTC+8)
    出版者: Elsevier
    摘要: The aim of this paper is twofold. First, it continues the development of a symbolic approach to approximate reasoning as an alternative to the well-known semantic approaches based on fuzzy sets. While this exacts a price in expressive power, it has the advantage of being computationally simpler. In addition, it accommodates formulation of certain aspects of approximate reasoning that are not easily expressed in terms of fuzzy sets, or where the notion of a fuzzy set might not naturally apply. Five different such forms of inference, or reasoning techniques, are discussed. Second, this work shows how the proposed symbolic approach may be implemented in a Prolog-like question-answering system, known as SAR. To illustrate, an automated bank loan advisor based on this system might be presented the query “Suitability(Jim)?” and respond with something like “Suitability(Jim; very_good).” To this end we develop SAR resolution, an adaptation of the well-known SLD resolution which underlies Prolog. SAR resolution differs from the earlier version in that (1) it requires generation of a resolution tree, rather than a single path, (2) it requires attaching a computational formula to each resolvent, reflecting the particular inferencing technique being employed at that step, and (3) it requires incorporating a means for (symbolic) evidence combination. In generating and traversing the resolution tree, SAR resolution behaves essentially as SLD resolution when moving in the downward direction (from the root), and applies computational formulas and evidence combination procedures when moving in the upward direction. Thus it is more complex than SLD resolution, but is nonetheless simple enough for many real-world applications. In effect SAR is a general purpose “fuzzy classifier” and accordingly should find use in many expert systems of the classification genre, e.g., for diagnosis, troubleshooting, monitoring, and multicriteria decision making. The SAR resolution technique easily accommodates forms of inference other than the five discussed here. As examples: one could adjoin the well-known “compositional rule of inference,” or a mode of inference whose underlying computation is provided by a neural net. Thus this paper implicitly provides a general methodology by which one may devise reasoning systems that present the user with a variety of inferencing techniques, from which one may then choose as the situation demands.
    關聯: International journal of approximate reasoning 13(3), pp.201-246
    DOI: 10.1016/0888-613X(95)00075-R
    显示于类别:[資訊工程學系暨研究所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    0KbUnknown254检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回馈