On the computational cost of disjunctive logic programming: Propositional case

@article{Eiter1995OnTC,
  title={On the computational cost of disjunctive logic programming: Propositional case},
  author={Thomas Eiter and Georg Gottlob},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={1995},
  volume={15},
  pages={289-323}
}
This paper addresses complexity issues for important problems arising with disjunctive logic programming. In particular, the complexity of deciding whether a disjunctive logic program is consistent is investigated for a variety of well-known semantics, as well as the complexity of deciding whether a propositional formula is satisfied by all models according to a given semantics. We concentrate on finite propositional disjunctive programs with as well as without integrity constraints, i.e… CONTINUE READING
Highly Influential
This paper has highly influenced 41 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 215 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 64 references

Propositional semantics for disjunctivelogicprograms

  • R. Ben-Eliyahu, R. Dechter
  • Proc. ICLP/ SLP-7, 1992, pp. 813-827. Full paper…
  • 1994
Highly Influential
20 Excerpts

Disjunctive defaults

  • M. Gelfond, H. Przymusinska, V. Lifschitz, M. Truszczyfiski
  • Proc. KR- 2
  • 1991
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…