用更少的资源获得更好的仿相干答案集
Better Paracoherent Answer Sets with Less Resources
摘要:
答案集编程(ASP)是一种成熟的逻辑编程形式。在ASP中解决问题需要编写一个ASP程序,其答案集对应于解决方案。虽然答案集的不存在对于某些ASP程序可以被认为是一个建模特性,但在许多其他情况下,它是一个弱点,特别是对于查询回答。仿相干答案集语义扩展了ASP的经典语义,使其可以从不相干的程序中得出有意义的结论,从而扩大了ASP的应用范围。paracoherent ASP的最新实现采用半平衡语义,但不能直接提升以有效地计算丢弃不期望的半平衡模型的(更好的)分裂半平衡语义。本文提出了一种计算分裂半平衡模型的有效评价方法。在硬基准测试上的实验表明,与现有的方法相比,该方法可以计算出更好的仿相干答案集。正在考虑接受TPLP。
英文摘要:
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. Under consideration for acceptance in TPLP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。