• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Default logic as a general nonmonotonic reasoning paradigm.
【24h】

Default logic as a general nonmonotonic reasoning paradigm.

机译：默认逻辑作为一般的非单调推理范例。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Default logic was proposed by Reiter as a viable paradigm for nonmonotonic reasoning. The premise behind default logic is that people tend to believe things by default, or in absence of the evidence to the contrary. In this manner, information that is not explicitly stated can be inferred from a default theory.; Despite the powerful nature of default logic, it has not been used extensively as a logic programming paradigm. Two primary causes for this have been identified. The first is that there is no general top-down proof procedure for default logic. Thus, although default logic may give us intuitively correct results, there is no easy way to compute them. The second is that default logic is not well understood in terms of contemporary non-monotonic reasoning paradigms, such as the well-founded semantics or the stationary semantics, preventing default logic from being identified with the current science of logic programming. This thesis is an attempt to alleviate these problems.; First, default logic is related to the well-founded semantics. More specifically, it is shown that a logic program P can be translated, via a syntactic translation, into a default theory {dollar}Pi{dollar}, such that {dollar}Pi{dollar} has a single extension corresponding to the well-founded model of P. Thus, default logic can be used to represent the well-founded semantics. The possibility that default logic can be used to represent the stationary semantics is also discussed. Hence, default logic is shown to be an integral part of contemporary logic programming.; Once default logic has been given this broader representational power, a top-down proof procedure is developed. The proof procedure has several nice properties. It is valid for a larger class of default theories than any other proof procedure previously developed for default logic, encompassing normal default theories, stratifiable default theories, and many semi-normal default theories. Further, the procedure does not necessarily have to look at all defaults in order to develop a proof, giving it the potential to be more efficient than a bottom up approach. Finally, the procedure returns a subset of the entire extension, making future queries more efficient.
机译：Reiter提出默认逻辑是非单调推理的可行范例。默认逻辑背后的前提是，人们倾向于默认或在没有相反证据的情况下相信事物。这样，可以从默认理论中推断出未明确说明的信息。尽管默认逻辑功能强大，但尚未广泛用作逻辑编程范例。已经确定了两个主要原因。首先是默认逻辑没有通用的自顶向下证明程序。因此，尽管默认逻辑可以直观地给我们正确的结果，但是没有简单的方法可以计算出结果。第二个原因是默认逻辑在当代非单调推理范式（例如有充分根据的语义或固定语义）方面没有得到很好的理解，从而阻止了默认逻辑被当前的逻辑编程科学所识别。本文旨在减轻这些问题。首先，默认逻辑与良好的语义相关。更具体地，示出了可以通过语法翻译将逻辑程序P翻译成默认理论{dol} Pi {dollar}，使得{dollar} Pi {dollar}具有对应于井的单个扩展。因此，可以使用默认逻辑来表示有充分根据的语义。还讨论了默认逻辑可用于表示固定语义的可能性。因此，默认逻辑被证明是当代逻辑编程不可或缺的一部分。一旦为默认逻辑赋予了更广泛的表示能力，便开发了一种自顶向下的证明程序。证明程序具有几个不错的属性。与以前为默认逻辑开发的任何其他证明程序相比，它对更大种类的默认理论有效，其中包括普通默认理论，可分层默认理论和许多半普通默认理论。此外，该过程不必为了开发证明而必须查看所有默认值，从而使其有可能比自底向上方法更有效。最后，该过程返回整个扩展的子集，从而使将来的查询更加高效。

著录项

  • 作者

    Barback, Monica Digna.;

  • 作者单位

    Northwestern University.;

  • 授予单位 Northwestern University.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 1994
  • 页码 144 p.
  • 总页数 144
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号