首页> 外文期刊>Journal of logic and computation >Bottom-up Construction of Semantic Tableaux
【24h】

Bottom-up Construction of Semantic Tableaux

机译:语义表的自下而上的构造

获取原文
获取原文并翻译 | 示例
           

摘要

We present a new proof procedure for first-order logic. Our approach is closely related to semantic tableaux, but it uses a more compact representation of the search space. The idea is to construct the tableau from the leaves to the root, which helps to factorize common subtrees and reduces the information that must be stored in a given branch. We prove that the method is sound and refutationally complete and we provide simplification rules in order to prune the search space and delete redundant inferences. We show that our procedure runs in polynomial time for several propositional classes, including the Hom-renamable class or the Krom class. This article is an extended version of Peltier (2007, LNAI 4548).
机译:我们提出了一阶逻辑的新证明程序。我们的方法与语义表密切相关,但是它使用了搜索空间的更紧凑表示。这个想法是从叶子到根来构造画面,这有助于分解公共子树并减少必须存储在给定分支中的信息。我们证明了该方法是正确且反驳的,并且提供了简化规则以修剪搜索空间并删除多余的推论。我们证明,我们的程序针对多项命题类(包括Hom可移植类或Krom类)在多项式时间内运行。本文是Peltier的扩展版本(2007,LNAI 4548)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号