Skip to main content Accessibility help
×
Home

On the problem of computing the well-founded semantics

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

Abstract

The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O([mid ]At(P)[mid ] × size(P)) steps, where size(P) denotes the total number of occurrences of atoms in a logic program P. This bound is achieved by an algorithm introduced by Van Gelder and known as the alternating-fixpoint algorithm. Improving on the alternating-fixpoint algorithm turned out to be difficult. In this paper we study extensions and modifications of the alternating-fixpoint approach. We then restrict our attention to the class of programs whose rules have no more than one positive occurrence of an atom in their bodies. For programs in that class we propose a new implementation of the alternating-fixpoint method in which false atoms are computed in a top-down fashion. We show that our algorithm is faster than other known algorithms and that for a wide class of programs it is linear and so, asymptotically optimal.

Copyright

Footnotes

Hide All
A preliminary version of this paper appeared in the Proceedings of Computational Logic – CL 2000, Lecture Notes in Artificial Intelligence, 1861, Springer-Verlag, 2000.

Footnotes

Keywords

On the problem of computing the well-founded semantics

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

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