Sciweavers

Share
CORR
2002
Springer

Computing stable models: worst-case performance estimates

8 years 8 months ago
Computing stable models: worst-case performance estimates
Abstract. 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(m2n), 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 1:44225n). We present similar results for several broader classes of programs, as well.
Zbigniew Lonc, Miroslaw Truszczynski
Added 18 Dec 2010
Updated 18 Dec 2010
Type Journal
Year 2002
Where CORR
Authors Zbigniew Lonc, Miroslaw Truszczynski
Comments (0)
books