On Reasoning by Cases in Clausal Default Logic
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

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

    In this paper, a kind of tree method is proposed to investigate Roos extensions about the reasoning by cases in default logic, discuss deeply the computation of Roos extensions and analyze the relationship between Roos extensions and Reiter s extensions. The algorithm decomposing the smallest set of literals from a set of clauses is presented to compute Roos extensions. The method is useful for computing Roos extensions and analyzing the complexity of reasoning by cases in default logic.

    Reference
    Related
    Cited by
Get Citation

许道云,丁德成,张明义.子句型缺省逻辑中的分情形推理.软件学报,2001,12(8):1140-1146

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
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