...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Theory and Practice of Logic Programming >Better Paracoherent Answer Sets with Less Resources
【24h】

Better Paracoherent Answer Sets with Less Resources

机译：使用更少的资源获得更好的超相干答案集

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

摘要

Answer Set Programming (ASP) is a well-established formalism for logic programming. Problem solving in ASP requires to write an ASP program whose answers sets correspond to solutions. Albeit the non-existence of answer sets for some ASP programs can be considered as a modeling feature, it turns out to be a weakness in many other cases, and especially for query answering. Paracoherent answer set semantics extend the classical semantics of ASP to draw meaningful conclusions also from incoherent programs, with the result of increasing the range of applications of ASP. State of the art implementations of paracoherent ASP adopt the semi-equilibrium semantics, but cannot be lifted straightforwardly to compute efficiently the (better) split semi-equilibrium semantics that discards undesirable semi-equilibrium models. In this paper an efficient evaluation technique for computing a split semi-equilibrium model is presented. An experiment on hard benchmarks shows that better paracoherent answer sets can be computed consuming less computational resources than existing methods.
机译：答案集编程（ASP）是一种公认​​的逻辑编程形式。在ASP中解决问题需要编写一个ASP程序，其答案集与解决方案相对应。尽管可以将某些ASP程序的答案集不存在视为建模功能，但在许多其他情况下，尤其是对于查询答案，这却是一个弱点。超相干答案集语义扩展了ASP的经典语义，从而也可以从非相干程序中得出有意义的结论，从而扩大了ASP的应用范围。超相干ASP的最新技术实现采用半平衡语义，但不能直接提升以有效地计算（更好的）拆分半平衡语义，从而丢弃不期望的半平衡模型。本文提出了一种有效的评估技术，用于计算分裂半平衡模型。硬基准测试表明，与现有方法相比，可以计算出更好的超相干答案集，并且消耗的计算资源更少。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号