1. Foreword

   • Martin Charles Golumbic
   • Frederick Hoffman

   EditorialNotes Pages: I - II

2. Generalized disjunctive well-founded semantics for logic programs

   • Chitta Baral
   • Jorge Lobo
   • Jack Minker

   OriginalPaper Pages: 89 - 131

3. New approaches for understanding the asymptotic complexity of A^* tree searching

   • Stephen V. Chenoweth
   • Henry W. Davis

   OriginalPaper Pages: 133 - 162

4. Computational complexity and constraint logic programming languages

   • Jim Cox
   • Ken McAloon
   • Carol Tretkoff

   OriginalPaper Pages: 163 - 189

5. The mathematical modeling of heuristics

   • Henry W. Davis
   • Stephen V. Chenoweth

   OriginalPaper Pages: 191 - 227

6. A theory of nonmonotonic rule systems II

   • W. Marek
   • A. Nerode
   • J. Remmel

   OriginalPaper Pages: 229 - 263

   

7. An upper bound on the time complexity of iterative-deepening-A^*

   • Brian G. Patrick
   • Mohammed Almulla
   • Monroe M. Newborn

   OriginalPaper Pages: 265 - 277

8. Formalizing a logic for logic programming

   • John S. Schlipf

   OriginalPaper Pages: 279 - 302

9. Standard forms for rational linear arithmetic in constraint logic programming

   • Pascal Van Hentenryck
   • Thomas Graf

   OriginalPaper Pages: 303 - 319

10. The application of automated reasoning to questions in mathematics and logic

    • Larry Wos
    • William McCune

    OriginalPaper Pages: 321 - 369

11. Call for papers

    Announcement Pages: III - III