Skip to main content Accessibility help
×
Home

Computing stable models: worst-case performance estimates

  • ZBIGNIEW LONC (a1) and MIROSŁAW TRUSZCZYŃSKI (a2)

Abstract

We study algorithms for computing stable models of 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. Finally, we study the applicability of the techniques developed in the paper to the analysis of the performance of smodels.

Copyright

Computing stable models: worst-case performance estimates

  • ZBIGNIEW LONC (a1) and MIROSŁAW TRUSZCZYŃSKI (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed