Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (4): 101-103.

• 研发、测试 • Previous Articles     Next Articles

Heuristic algorithm for computing quasi-support set in PAS

YE Jian-wei,ZENG Cheng,WU Ping-hui   

  1. Department of Information Engineering,Hebei University of Technology,Tianjin 300130,China
  • Received:2007-06-22 Revised:2007-11-22 Online:2008-02-01 Published:2008-02-01
  • Contact: YE Jian-wei

一种计算PAS准支持集合的启发性算法

叶建伟,曾 成,武萍辉   

  1. 河北工业大学 信息工程学院,天津 300130
  • 通讯作者: 叶建伟

Abstract: Being combined with propositional logic and classical probability theory,Probabilistic Argumentation Systems allows to judge open questions from a qualitative and quantitative point of view.This article proposes a heuristic algorithm to solve the computation question of quasi-support sets.The analysis on theory and the example proves that this algorithm can reduce the amount of calculation effectively,and can be programmed easily.

Key words: probabilistic argumentation systems, heuristic algorithm, quasi-support sets

摘要: 概率论据系统将命题逻辑与传统概率论相结合,可以对开放性问题作出定性或定量地判断。针对概率论据系统的准支持集合的计算问题,提出一种启发性算法。理论分析和实例验证表明该方法可有效减少计算量,并易于编程实现。

关键词: 概率论据系统, 启发性算法, 准支持集合