Extended symbolic approximate reasoning based on linguistic modifiers

被引:0
|
作者
Saoussen Bel Hadj Kacem
Amel Borgi
Moncef Tagina
机构
[1] University of Manouba,National School of Computer Sciences
[2] University of Tunis,SOIE Research Laboratory, ISG
[3] Université de Tunis El Manar,LIRPAH Research Laboratory, Institut Supérieur d’Informatique
来源
关键词
Symbolic multi-valued logic; Approximate reasoning ; Conjunctive and disjunctive rules; Linguistic modifiers ; Computing with words; Aggregation operators;
D O I
暂无
中图分类号
学科分类号
摘要
Approximate reasoning allows inferring with imperfect knowledge. It is based on a generalization of modus ponens (MP) known as generalized modus ponens (GMP). We are interested in approximate reasoning within symbolic multi-valued logic framework. In a previous work, we have proposed a new GMP based on linguistic modifiers in the multi-valued logic framework. The use of linguistic modifiers allows having a gradual reasoning; moreover, it allows checking axiomatics of approximate reasoning. In this paper, we extend our approximate reasoning to hold with complex rules, i.e., rules whose premises are conjunction or disjunction of propositions. For this purpose, we introduce a new operator that aggregates linguistic modifiers and verifies the required properties of logical connectives within the multi-valued logic framework.
引用
收藏
页码:633 / 661
页数:28
相关论文
共 50 条
  • [1] Extended symbolic approximate reasoning based on linguistic modifiers
    Kacem, Saoussen Bel Hadj
    Borgi, Amel
    Tagina, Moncef
    KNOWLEDGE AND INFORMATION SYSTEMS, 2015, 42 (03) : 633 - 661
  • [2] Approximate reasoning with linguistic modifiers
    Ying, MS
    Bouchon-Meunier, B
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 1998, 13 (05) : 403 - 418
  • [3] APPROXIMATE REASONING BASED ON LINGUISTIC MODIFIERS IN A LEARNING SYSTEM
    Kacem, Saoussen Bel Hadj
    Borgi, Amel
    Tagina, Moncef
    ICSOFT 2010: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON SOFTWARE AND DATA TECHNOLOGIES, VOL 2, 2010, : 431 - 437
  • [4] On Some Properties of Generalized Symbolic Modifiers and Their Role in Symbolic Approximate Reasoning
    Kacem, Saoussen Bel Hadi
    Borgi, Amel
    Tagina, Moncef
    EMERGING INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS: WITH ASPECTS OF ARTIFICIAL INTELLIGENCE, 2009, 5755 : 190 - +
  • [5] Generalized if ... then ... else inference rules with linguistic modifiers for approximate reasoning
    Phuong, Le Anh
    Khang, Tran Dinh
    International Journal of Computer Science Issues, 2012, 9 (6-3): : 184 - 190
  • [6] Generalized Modus Tollens with Linguistic Modifiers for Inverse Approximate Reasoning
    Le Anh Phuong
    Tran Dinh Khang
    International Journal of Computational Intelligence Systems, 2014, 7 : 556 - 564
  • [7] Generalized Modus Tollens with Linguistic Modifiers for Inverse Approximate Reasoning
    Le Anh Phuong
    Tran Dinh Khang
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2014, 7 (03) : 556 - 564
  • [8] Linguistic modifiers in a symbolic framework
    Akdag, H
    Truck, I
    Borgi, A
    Mellouli, N
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2001, 9 : 49 - 61
  • [9] A symbolic approximate reasoning
    El-Sayed, M
    Pacholczyk, D
    ROUGH SETS, FUZZY SETS, DATA MINING, AND GRANULAR COMPUTING, 2003, 2639 : 368 - 373
  • [10] LINGUISTIC RECOGNITION SYSTEM BASED ON APPROXIMATE REASONING
    PAL, SK
    MANDAL, DP
    INFORMATION SCIENCES, 1992, 61 (1-2) : 135 - 161