Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran
TL;DR该研究讨论了如何在Answer Set Programming中进行强持续性遗忘,通过提出各种遗忘算子并探究其可行性、可行性不足时的替代方案以及与相对等价概念的关系,最终对其计算复杂性进行了详细研究。
Abstract
Among the myriad of desirable properties discussed in the context of forgetting in answer set programming (ASP), strong persistence naturally captures its essence. Recently, it has been shown that it is not alway