TL;DR提出一种基于逻辑编程的建模范式,将 ASP 和 QBF 的最佳特性相结合,实现对高层次搜索问题的编码。
Abstract
Standard answer set programming (ASP) targets at solving search problems from
the first level of the polynomial time hierarchy (PH). Tackling search problems
beyond NP using ASP is less straightforward. The class of disjunctive logic
programs offers the most prominent way of reaching t