Computing large and small stable models

02/03/2000
by   Miroslaw Truszczynski, et al.
0

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].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/1999

Extremal problems in logic programming and stable model computation

We study the following problem: given a class of logic programs C, deter...
research
07/13/2021

An FPT algorithm for the embeddability of graphs into two-dimensional simplicial complexes

We consider the embeddability problem of a graph G into a two-dimensiona...
research
05/11/2002

Computing stable models: worst-case performance estimates

We study algorithms for computing stable models of propositional logic p...
research
02/21/2014

Characterizing and computing stable models of logic programs: The non-stratified case

Stable Logic Programming (SLP) is an emergent, alternative style of logi...
research
04/04/2023

Learning Stable and Robust Linear Parameter-Varying State-Space Models

This paper presents two direct parameterizations of stable and robust li...
research
07/01/2023

Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard

Let d be a positive integer. For a finite set X ⊆ℝ^d, we define its inte...
research
12/15/2017

The HOMFLY-PT polynomial is fixed-parameter tractable

Many polynomial invariants of knots and links, including the Jones and H...

Please sign up or login with your details

Forgot password? Click here to reset