1. Learning-theoretic perspectives of acceptable numberings

   • Ganesh R. Baliga
   • Anil M. Shende

   OriginalPaper Pages: 177 - 187

2. Intelligent backtracking in CLP(ℜ)

   • Jennifer J. Burg
   • Sheau-Dong Lang
   • Charles E. Hughes

   OriginalPaper Pages: 189 - 211

3. Seminormal stratified default theories

   • Paweł Cholewiński

   OriginalPaper Pages: 213 - 234

4. Program tactics and logic tactics

   • Fausto Giunchiglia
   • Paolo Traverso

   OriginalPaper Pages: 235 - 259

5. Polynomial-time computable stable models

   • Luigi Palopoli
   • Carlo Zaniolo

   OriginalPaper Pages: 261 - 290

6. A modal contrastive logic: The logic of ‘but’

   • J. -J. Ch. Meyer
   • W. van der Hoek

   OriginalPaper Pages: 291 - 313

7. A BDD SAT solver for satisfiability testing: An industrial case study

   • Ruchir Puri
   • Jun Gu

   OriginalPaper Pages: 315 - 337

8. Hierarchies of polynomially solvable satisfiability problems

   • Daniele Pretolani

   OriginalPaper Pages: 339 - 357

9. A cost effective question-asking strategy for Horn clause systems

   • Jinchang Wang
   • Evangelos Triantaphyllou

   OriginalPaper Pages: 359 - 379

10. A fast parallel SAT-solver — efficient workload balancing

    • Max Böhm
    • Ewald Speckenmeyer

    OriginalPaper Pages: 381 - 400