On the computation of disjunctive stable models

  • N. Leone
  • P. Rullo
  • F. Scarcello
Theoretical Aspects 2

DOI: 10.1007/BFb0034719

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)
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

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • N. Leone
    • 1
  • P. Rullo
    • 2
  • F. Scarcello
    • 3
  1. 1.Institut für InformationssystemeTU WienWienAustria
  2. 2.DIMET - Università di Reggio CalabriaReggio CalabriaItaly
  3. 3.DEIS - Università della CalabriaRendeItaly

Personalised recommendations