期刊文献+

若干限制形式的缺省推理的复杂性(英文) 被引量:2

Complexity Results for Restricted Credulous Default Reasoning
下载PDF
导出
摘要 该文研究判定一文字是否出现在缺省理论〈D,W〉的某一扩张中的复杂性 .其中 ,D是一集 Horn缺省规则 ,而 W是 definite Horn公式或者 Bi- 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.
出处 《软件学报》 EI CSCD 北大核心 2000年第7期881-888,共8页 Journal of Software
基金 This research is supported by the National Natural Science Foundation of China (国家自然科学基金 Nos.197710 45 199310 2 0
关键词 轻信推理 限制形式 缺省推理 复杂性 Default logic, Horn default, credulous reasoning.
  • 相关文献

参考文献9

  • 1Reiter R.A logic for default reasoning[].Artificial Intelligence.1980
  • 2Cadoli M,Schaerf M.A survey of complexity results for non-monotonic logics[].Journal of Applied Logic.1993
  • 3Ben-Eliyahu R,Dechter R.Default logic, propositional logic and constraints[].In: Proceedings of the th National Conference on Artificial Intelligence (AAAI’ ).1991
  • 4Dimopoulos Y,Magirou V.A graph theoretic approach to default logic[].Information and Computation.1994
  • 5Etherington D V.Reasoning with Incomplete Information[]..1987
  • 6Kautz H A,Selman B.Hard problems for simple default logics[].Artificial Intelligence.1990
  • 7Kleine H Büning.Propositional Logic: Deduction and Algorithm[]..1997
  • 8.
  • 9Stillman,J.The complexity of propositional default logics[].Proceedings of the th National Conference on Artificial Intelligence.1992

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部