Computing Large and Small Stable Models

In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed 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 jPj 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 xed-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(nc), where c is a constant independent of k. We also provide an upper bound on the xed-parameter complexity of the problem SSM by showing that it belongs to the class W 3].

• Type: Conference
• Year: 1999
• Where: ICLP
• Authors: Miroslaw Truszczynski
• Keywords: Automated Reasoning, ICLP 1999, Large Stable Models, Stable Models, Stable Models Problem