关于ASP中的极小修正
On Minimal Corrections in ASP
摘要:
作为一种编程范式,答案集编程(ASP)带来了常见的人为错误问题。因此,希望提供可以帮助程序员找到错误的自动化技术。本文讨论的问题,计算一个子集的最小更正的矛盾ASP程序。一个矛盾的ASP程序往往是不可取的,我们希望提供一个自动化的方法来修复它。我们认为一个矛盾的程序的最小校正集是一个不可约的规则集,其删除使程序一致。与命题逻辑相反,ASP程序的更正行为是非单调的。然而,我们表明,各种算法的修正集计算命题逻辑可以移植到ASP。进行了实验评估表明,有这样的算法的投资组合确实是有益的。
英文摘要:
As a programming paradigm, answer set programming (ASP) brings about the usual issue of the human error. Hence, it is desirable to provide automated techniques that could help the programmer to find the error. This paper addresses the question of computing a subset-minimal correction of a contradictory ASP program. A contradictory ASP program is often undesirable and we wish to provide an automated way of fixing it. We consider a minimal correction set of a contradictory program to be an irreducible set of rules whose removal makes the program consistent. In contrast to propositional logic, corrections of ASP programs behave non-monotonically. Nevertheless, we show that a variety of algorithms for correction set computation in propositional logic can be ported to ASP. An experimental evaluation was carried showing that having a portfolio of such algorithms is indeed of benefit.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。