###
DOI:
Journal of Software:2000.11(7):881-888

若干限制形式的缺省推理的复杂性
赵希顺,丁德成
(南京大学数学系,南京,210093;扬州大学数学系,扬州,225002)
Complexity Results for Restricted Credulous Default Reasoning
HAO Xi-shun,DING De-cheng
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2086   Download 2622
Received:December 23, 1998    Revised:May 10, 1999
> 中文摘要: 该文研究判定一文字是否出现在缺省理论〈D,W〉的某一扩张中的复杂性.其中,D是一集Horn缺省规则,而W是definite Horn公式或者Bi-Horn公式.
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.
文章编号:     中图分类号:    文献标志码:
基金项目:This research is supported by the National Natural Science Foundation of China(国家自然科学基金,Nos.19771045,19931020)(and the National High Technology Development Program of China国家863高科技项目基金,No.863-306-ZT06-01-2) This research is supported by the National Natural Science Foundation of China(国家自然科学基金,Nos.19771045,19931020)(and the National High Technology Development Program of China国家863高科技项目基金,No.863-306-ZT06-01-2)
Foundation items:
Reference text:

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

HAO Xi-shun,DING De-cheng.Complexity Results for Restricted Credulous Default Reasoning.Journal of Software,2000,11(7):881-888