On the computation of disjunctive stable models
- First Online:
- Cite this paper as:
- Leone N., Rullo P., Scarcello F. (1996) On the computation of disjunctive stable models. In: Wagner R.R., Thoma H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg
An efficient algorithm for the computation of the stable model semantics of disjunctive logic programs is designed. Both soundness and completeness of the proposed method is formally proven. The computational complexity of the algorithm is also analyzed. In general, the algorithm runs in single exponential time and polynomial space (in the worst case); moreover, on some known tractable classes of programs it runs in polynomial time.
Unable to display preview. Download preview PDF.