1. Compositional model-theoretic semantics for logic programs

   • Antonio Brogi
   • Evelina Lamma
   • Paola Mello

   Regular Papers Pages: 1 - 21

2. Verifying local stratifiability of logic programs and databases

   • Yi-Dong Shen

   Regular Papers Pages: 23 - 46

3. A general criterion for avoiding infinite unfolding during partial deduction

   • Maurice Bruynooghe
   • Danny De Schreye
   • Bern Martens

   Regular Papers Pages: 47 - 79

4. Performance of Muse on switch-based multiprocessor machines

   • Khayri A. M. Ali
   • Roland Karlsson
   • Shyam Mudambi

   Regular Papers Pages: 81 - 103