Paraconsistent reasoning with words

被引:1
|
作者
Szalas, Alicja S. [1 ]
Szalas, Andrzej [2 ,3 ]
机构
[1] School of Biological Sciences, Royal Holloway, University of London, Cooper’s Hill Lane Kingswood 1 Hall - C151, Egham, Surrey,TW200LG, United Kingdom
[2] Institute of Informatics, Warsaw University, Warsaw,02-097, Poland
[3] Department of Computer and Information Science, Linköping University, Linköping,581 83, Sweden
关键词
Four-valued logic - Fuzzy modeling - Intuitionistic fuzzy sets - Logical formalism - Model uncertainties - Paraconsistent reasoning - Qualitative approach - Reasoning with words;
D O I
10.1007/978-3-642-04735-0_2
中图分类号
学科分类号
摘要
Fuzzy logics are one of the most frequent approaches to model uncertainty and vagueness. In the case of fuzzy modeling, degrees of belief and disbelief sum up to 1, which causes problems in modeling the lack of knowledge and inconsistency. Therefore, so called paraconsistent intuitionistic fuzzy sets have been introduced, where the degrees of belief and disbelief are not required to sum up to 1. The situation when this sum is smaller than 1 reflects the lack of knowledge and its value greater than 1 models inconsistency. In many applications there is a strong need to guide and interpret fuzzy-like reasoning using qualitative approaches. To achieve this goal in the presence of uncertainty, lack of knowledge and inconsistency, we provide a framework for qualitative interpretation of the results of fuzzy-like reasoning by labeling numbers with words, like true, false, inconsistent, unknown, reflecting truth values of a suitable, usually finitely valued logical formalism. © Springer-Verlag Berlin Heidelberg 2009.
引用
收藏
页码:43 / 58
相关论文
共 50 条
  • [21] Paraconsistent Reasoning with Quasi-classical Semantic in ALC
    Zhang, Xiaowang
    Lin, Zuoquan
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2008, 5341 : 222 - 229
  • [22] Paraconsistent reasoning for inconsistency measurement in declarative process specifications
    Corea, Carl
    Kuhlmann, Isabelle
    Thimm, Matthias
    John, Grant
    INFORMATION SYSTEMS, 2024, 122
  • [23] Paraconsistent preferential reasoning by signed quantified Boolean formulae
    Arieli, O
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 773 - 777
  • [24] Representing paraconsistent reasoning via quantified propositional logic
    Besnard, P
    Schaub, T
    Tompits, H
    Woltran, S
    INCONSISTENCY TOLERANCE, 2004, 3300 : 84 - 118
  • [25] Three-Valued Paraconsistent Reasoning for Semantic Web Agents
    Nguyen, Linh Anh
    Szalas, Andrzej
    AGENT AND MULTI-AGENT SYSTEMS: TECHNOLOGIES AND APPLICATIONS, PT I, PROCEEDINGS, 2010, 6070 : 152 - 162
  • [26] PARACONSISTENT RULE-BASED REASONING WITH GRADED TRUTH VALUES
    De Angelis, Francesco Luca
    Serugendo, Giovanna Di Marzo
    Szalas, Andrzej
    JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2018, 5 (01): : 185 - 220
  • [27] Paraconsistent Before-After Relation Reasoning Based on EVALPSN
    Nakamatsu, Kazumi
    Abe, Jair Minoro
    Akama, Seiki
    NEW DIRECTIONS IN INTELLIGENT INTERACTIVE MULTIMEDIA, 2008, 142 : 265 - +
  • [28] Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
    Arieli, Ofer
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2007, 8 (03)
  • [29] A unit resolution-based approach to tractable and paraconsistent reasoning
    Coste-Marquis, S
    Marquis, P
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 803 - 807
  • [30] PROSE: A Plugin-Based Framework for Paraconsistent Reasoning on Semantic Web
    Zhang, Xiaowang
    Feng, Zhiyong
    Wu, Wenrui
    Wang, Xin
    Rao, Guozheng
    INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS, 2018, 14 (01) : 121 - 139