Computing stable models: worst-case performance estimates

Details Computing stable models: worst-case performance estimates Computing stable models: worst-case performance estimates

2002-05-11

arxiv.org/abs/cs/0205013v1

Computer Science

Logic in Computer Science

Paper published in the Proceedings of the International Conference on Logic Programming, ICLP-2002

Scientific paper

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(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, as well.

Affiliated with

Also associated with

No associations

Rating

Computing stable models: worst-case performance estimates does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing stable models: worst-case performance estimates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing stable models: worst-case performance estimates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211387