首页> 外文会议>Scalable uncertainty management >Finite Satisfiability in Infinite-Valued Lukasiewicz Logic
【24h】

Finite Satisfiability in Infinite-Valued Lukasiewicz Logic

机译:无限值Lukasiewicz逻辑的有限可满足性

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

摘要

Although it is well-known that every satisfiable formula in Lukasiewicz' infinite-valued logic L_∞ can be satisfied in some finite-valued logic, practical methods for finding an appropriate number of truth degrees do currently not exist. As a first step towards efficient reasoning in L_∞, we propose a method to find a tight upper bound on this number which, in practice, often significantly improves the worst-case upper bound of Aguzzoli et al.
机译:尽管众所周知,在某些有限值逻辑中可以满足Lukasiewicz无限值逻辑L_∞中的每个可满足公式,但目前尚不存在找到适当数量的真度的实用方法。作为在L_∞中进行有效推理的第一步,我们提出了一种在此数字上找到严格上限的方法,实际上,该方法通常可以显着改善Aguzzoli等人的最坏情况上限。

著录项

  • 来源
    《Scalable uncertainty management》|2009年|240-254|共15页
  • 会议地点 Washington DC(US);Washington DC(US)
  • 作者单位

    Dept. of Applied Mathematics and Computer Science, Ghent University, Belgium;

    Dept. of Computer Science, Vrije Universiteit Brussel, Belgium;

    Dept. of Computer Science, Vrije Universiteit Brussel, Belgium;

    Dept. of Applied Mathematics and Computer Science, Ghent University, Belgium Institute of Technology, University of Washington, Tacoma, WA, USA;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 计算技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号