arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0205013cs.LOcs.AI
收藏

计算稳定模型:最坏情况下的性能估计

Computing stable models: worst-case performance estimates

Zbigniew Lonc, Miroslaw Truszczynski

摘要:

我们研究算法计算稳定模型的命题逻辑程序,并得出估计其最坏情况下的性能是渐近优于平凡界的O(m2 ^n),其中m是输入程序的大小和n是它的原子数。例如,对于子句最多包含两个字面值(算上头)的程序,我们设计了一个算法来计算时间复杂度为O(m \times 1.44225 ^n)的稳定模型。我们提出了类似的结果,为几个更广泛的类的程序,以及。

英文摘要:

We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial bound of O(m 2^n), where m is the size of an input program and n is the number of its atoms. For instance, for programs, whose clauses consist of at most two literals (counting the head) we design an algorithm to compute stable models that works in time O(m\times 1.44225^n). We present similar results for several broader classes of programs, as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑