• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of logic and computation >Anytime Approximations of Classical Logic from Above
【24h】

Anytime Approximations of Classical Logic from Above

机译：随时从上面近似经典逻辑

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

摘要

In this article we present s_1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of a parameterized family of logics established by Schaerf s and Cadoli's system S_1. We show that s_1 inherits several of the nice properties of S_1, while presenting several attractive new properties. The family s_1 deals with the full propositional language, has a complete tableau proof system which provides for incremental approximations; furthermore, it constitutes a full approximation of classical logic from above, with an approximation process with better relevance and locality properties than S_1. When applied to clausal inference, s_1 provides a strong simplification method. An application of s_1 to model-based diagnosis is presented, demonstrating how the solution to this problem can benefit from the use of s_1 approximations.
机译：在本文中，我们介绍s_1，这是一组逻辑，可用于通过随时近似过程来反驳命题公式。该系统遵循由Schaerf和Cadoli的系统S_1建立的参数化逻辑族的范例。我们显示s_1继承了S_1的几个不错的属性，同时呈现了几个吸引人的新属性。 s_1族处理完整的命题语言，具有完整的Tableau证明系统，该系统提供增量逼近；此外，它从上面构成了经典逻辑的完全近似，具有比S_1更好的相关性和局部性的近似过程。当应用于子句推理时，s_1提供了一种强大的简化方法。介绍了s_1在基于模型的诊断中的应用，展示了如何使用s_1近似值可以解决此问题。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号