【24h】

Decidable Reasoning in a First-Order Logic of Limited Conditional Belief

机译:有限条件信仰的一阶逻辑可解断的推理

获取原文

摘要

In a series of papers, Liu, Lakemeyer, and Levesque address the problem of decidable reasoning in expressive first-order knowledge bases. Here, we extend their ideas to accommodate conditional beliefs, as in "if she is Australian, then she presumably eats Kangaroo meat." Perhaps the most prevalent semantics of a conditional belief is to evaluate the consequent in the most-plausible worlds consistent with the premise. In this paper, we devise a technique to approximate this notion of plausibility, and complement it with Liu, Lakemeyer, and Levesque's weak inference. Based on these ideas, we develop a logic of limited conditional belief, and provide soundness, decidability, and (for the propositional case) tractability results.
机译:在一系列论文中,刘,Lakemeyer和Levesque解决了表现力的一阶知识库中可判定的推理问题。 在这里,我们扩展了他们的想法,以适应有条件的信念,就像“如果她是澳大利亚人一样,那么她可能会吃袋鼠肉。” 也许有条件信念的最普遍的语义是评估与前提一致的最合理的世界中的结果。 在本文中,我们设计了一种方法来近似合理性的概念,并将其与Liu,Lakemeyer和Levesque的弱推断相提并论。 基于这些想法,我们开发了有限的条件信念的逻辑,并提供健全性,可拆卸性和(对于命题案例)途径结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号