1. Introduction

   • Howard Blair

   EditorialNotes Pages: I - II

2. Complexity and undecidability results for logic programming

   • John S. Schlipf

   OriginalPaper Pages: 257 - 288

3. On the computational cost of disjunctive logic programming: Propositional case

   • Thomas Eiter
   • Georg Gottlob

   OriginalPaper Pages: 289 - 323

4. A topological characterization of the stable and minimal model classes of propositional logic programs

   • Audrey P. Ferry

   OriginalPaper Pages: 325 - 355

5. Complexity of computing with extended propositional logic programs

   • V. Wiktor Marek
   • Arcot Rajasekar
   • Mirosław Truszczyński

   OriginalPaper Pages: 357 - 378

6. On the structural simplicity of machines and languages

   • Yael Moscowitz
   • Ehud Shapiro

   OriginalPaper Pages: 379 - 405

7. How expressive is stratified aggregation?

   • Inderpal Singh Mumick
   • Oded Shmueli

   OriginalPaper Pages: 407 - 435

8. On computability by logic programs

   • Andrei Voronkov

   OriginalPaper Pages: 437 - 456