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

计算大型和小型稳定模型

Computing large and small stable models

Miroslaw Truszczynski

摘要:

本文主要研究小稳定模型和大稳定模型的存在性和计算问题。我们证明了对于每个固定的整数k,存在一个线性时间算法来判定问题LSM(large stable models problem):一个逻辑程序P是否有一个大小至少为|P| -k的稳定模型.相比之下,我们表明,问题SSM(小稳定模型问题),以决定是否一个逻辑程序P有一个稳定的模型的大小最多k是困难得多。我们提出了两个算法,但他们的运行时间是由多项式的顺序取决于k。通过证明SSM问题是W[2]-困难的,我们证明了SSM问题是固定参数难处理的。这个结果意味着不太可能存在一个算法来计算最多为k的稳定模型,该算法将在时间O(n^c)内运行,其中c是与k无关的常数。我们还提供了一个上界的固定参数复杂性的问题SSM表明,它属于类W[3]。

英文摘要:

In this paper, we focus on the problem of existence and computing of small and large stable models. We show that for every fixed integer k, there is a linear-time algorithm to decide the problem LSM (large stable models problem): does a logic program P have a stable model of size at least |P|-k. In contrast, we show that the problem SSM (small stable models problem) to decide whether a logic program P has a stable model of size at most k is much harder. We present two algorithms for this problem but their running time is given by polynomials of order depending on k. We show that the problem SSM is fixed-parameter intractable by demonstrating that it is W[2]-hard. This result implies that it is unlikely, an algorithm exists to compute stable models of size at most k that would run in time O(n^c), where c is a constant independent of k. We also provide an upper bound on the fixed-parameter complexity of the problem SSM by showing that it belongs to the class W[3].

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

↑