Theoretical Aspects 2

Database and Expert Systems Applications

Volume 1134 of the series Lecture Notes in Computer Science pp 654-666


On the computation of disjunctive stable models

  • N. LeoneAffiliated withInstitut für Informationssysteme, TU Wien
  • , P. RulloAffiliated withDIMET - Università di Reggio Calabria
  • , F. ScarcelloAffiliated withDEIS - Università della Calabria

* Final gross prices may vary according to local VAT.

Get Access


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.