微信服务号

微信订阅号

Home > Archive>Volume 11, Issue 7, 2000 >881-888
PDF HTML XML Export Cite reminder
Complexity Results for Restricted Credulous Default Reasoning
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    This paper concentrates on the complexity of the decision problem which decides whether a literal belongs to at least one extension of a default theory 〈D,W〉 in which D is a set of Horn defaults and W is a definite Horn formula or a Bi-Horn formula.

    Reference
    Related
    Cited by
Get Citation

赵希顺,丁德成.若干限制形式的缺省推理的复杂性.软件学报,2000,11(7):881-888

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 23,1998
  • Revised:May 10,1999
  • 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