Date: 26 Jun 2005

On the computation of disjunctive stable models

* Final gross prices may vary according to local VAT.

Get Access

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.

Work partially supported by Christian Doppler Lab. for Expert Systems, Istituto per la Sistemistica e I'Informatica, ISI-CNR, the EC-US project ”DEUS EX MACHINA” and by a MURST grant (40% share) under the project ”Sistemi formali e strumenti per basi di dati evolute”.