计算最小模型、稳定模型和答案集
Computing minimal models, stable models and answer sets
摘要:
我们提出和研究算法来计算最小模型,稳定模型和答案集的t-CNF理论,正常和析取的t-程序。我们特别感兴趣的算法与非平凡的最坏情况下的性能界限。大部分的文件是有关类的2-和3-CNF理论,正常和析取2-和3-程序,我们得到显着更强的结果比我们的一般考虑所暗示的。我们证明了在O(m1.4422.^)时间内可以找到2-CNF理论的所有极小模型和析取2-规划的所有答案集n)。我们的主要结果涉及计算正常3-程序的稳定模型,3-CNF理论的极小模型和析取3-程序的答案集。我们设计的算法运行时间为O(m 1.6701..^ n)的时间复杂度为O(mn^2 2.2782..^(二)在后两种情况下。所有这些界限都以指数因子改进了以前已知的最佳算法。我们还获得了密切相关的最小模型,稳定模型和答案集的t-CNF理论,一个正常的t-程序或析取t-程序的数量上界。逻辑程序设计理论与实践(Theory and Practice of Logic Programming,TPLP)
英文摘要:
We propose and study algorithms to compute minimal models, stable models and answer sets of t-CNF theories, and normal and disjunctive t-programs. We are especially interested in algorithms with non-trivial worst-case performance bounds. The bulk of the paper is concerned with the classes of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs, for which we obtain significantly stronger results than those implied by our general considerations. We show that one can find all minimal models of 2-CNF theories and all answer sets of disjunctive 2-programs in time O(m 1.4422..^n). Our main results concern computing stable models of normal 3-programs, minimal models of 3-CNF theories and answer sets of disjunctive 3-programs. We design algorithms that run in time O(m 1.6701..^n), in the case of the first problem, and in time O(mn^2 2.2782..^n), in the case of the latter two. All these bounds improve by exponential factors the best algorithms known previously. We also obtain closely related upper bounds on the number of minimal models, stable models and answer sets a t-CNF theory, a normal t-program or a disjunctive t-program may have. To appear in Theory and Practice of Logic Programming (TPLP).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。