微信服务号

微信订阅号

Home > Archive>Volume 9, Issue 4, 1998 >273-275
PDF HTML XML Export Cite reminder
The Completeness of the Super-tree-like Decomposition Model for Probabilistic Logic
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
    • |
  • Figures
    • |
  • Metrics
    • |
  • Reference
    • |
  • Related
    • |
  • Cited by
    • |
  • Materials
    • |
  • Comments
    Abstract:

    In order to reduce the complexity in the calculation model of Nilsson's probabilistic logic, the authors presented a new approach with the super-tree-like decomposition model in this paper, and proved the completeness theorem of the given method.

    Reference
    Related
    Cited by
Get Citation

张晨东,陈火旺,王兵山,徐 光.概率逻辑类超树结构分解计算模型的完备性.软件学报,1998,9(4):273-275

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 20,1997
  • Revised:May 07,1997
  • Adopted:
  • Online:
  • Published:
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063