A qualitative approach to syllogistic reasoning

被引:1
作者
Khayata, MY [1 ]
Pacholczyk, D [1 ]
Garcia, L [1 ]
机构
[1] Univ Angers, LERIA, F-49045 Angers 01, France
关键词
knowledge representation; statistical information; linguistic quantifiers; quantified assertions; syllogistic reasoning;
D O I
10.1023/A:1014425907059
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we present a new approach to a symbolic treatment of quantified statements having the following form "Q A's are B's", knowing that A and B are labels denoting sets, and Q is a linguistic quantifier interpreted as a proportion evaluated in a qualitative way. Our model can be viewed as a symbolic generalization of statistical conditional probability notions as well as a symbolic generalization of the classical probabilistic operators. Our approach is founded on a symbolic finite M-valued logic in which the graduation scale of M symbolic quantifiers is translated in terms of truth degrees. Moreover, we propose symbolic inference rules allowing us to manage quantified statements.
引用
收藏
页码:131 / 159
页数:29
相关论文
共 35 条
  • [1] Adams ErnestW., 1975, LOGIC CONDITIONALS A
  • [2] Akdag H., 1992, Fundamenta Informaticae, V17, P333
  • [3] [Anonymous], 1991, PROBABILISTIC REASON
  • [4] From statistical knowledge bases to degrees of belief
    Bacchus, F
    Grove, AJ
    Halpern, JY
    Koller, D
    [J]. ARTIFICIAL INTELLIGENCE, 1996, 87 (1-2) : 75 - 143
  • [5] BACCHUS F, 1990, REPRESENTATION REASO
  • [6] Cheeseman P., 1988, Computational Intelligence, V4, P58, DOI 10.1111/j.1467-8640.1988.tb00091.x
  • [7] DUBOIS D, 1992, UNCERTAINTY IN ARTIFICIAL INTELLIGENCE, P74
  • [8] Dubois D., 1988, Computational Intelligence, V4, P171, DOI 10.1111/j.1467-8640.1988.tb00120.x
  • [9] Fine Terrence., 1973, THEORIES PROBABILITY
  • [10] HAJEK P, 1983, METODA GUHA AUTOMATI