1. Geometry and search in motion planning

   • Jean -Claude Latombe

   OriginalPaper Pages: 215 - 227

2. Relating logic programs via program maps

   • Marc Kirschenbaum
   • Leon Sterling
   • Ashish Jain

   OriginalPaper Pages: 229 - 245

3. A hypergraph model for constraint logic programming and applications to bus drivers' scheduling

   • Paolo Carraresi
   • Giorgio Gallo
   • Gabriella Rago

   OriginalPaper Pages: 247 - 270

4. Constraint programming and graph algorithms

   • Michel Gangnet
   • Burton Rosenberg

   OriginalPaper Pages: 271 - 284

5. Computational dynamics: Modeling and visualizing trajectory flows in phase space

   • Feng Zhao

   OriginalPaper Pages: 285 - 300

6. Describing symmetrical structures in logic

   • P. A. Strooper
   • M. H. van Emden

   OriginalPaper Pages: 301 - 314

7. Subsumption and indexing in constraint query languages with linear arithmetic constraints

   • Divesh Srivastava

   OriginalPaper Pages: 315 - 343

8. Cellular automata, matrix substitutions and fractals

   • F. v. Haeseler
   • H. -O. Peitgen
   • G. Skordev

   OriginalPaper Pages: 345 - 362

9. A recursion planning analysis of inductive completion

   • Richard Barnett
   • David Basin
   • Jane Hesketh

   OriginalPaper Pages: 363 - 381

10. Proving Ramsey's theorem by the cover set induction: A case and comparison study

    • Hantao Zhang
    • Gary Xin Hua

    OriginalPaper Pages: 383 - 405

11. A learning procedure for mathematics

    • Kurt Ammon

    OriginalPaper Pages: 407 - 423

12. Automated theorem proving in mathematics

    • Dominique Pastre

    OriginalPaper Pages: 425 - 447

13. Disjunctive LP+integrity constraints= stable model semantics

    • José Alberto Fernández
    • Jorge Lobo
    • V. S. Subrahmanian

    OriginalPaper Pages: 449 - 474

14. Embedding complex decision procedures inside an interactive theorem prover

    • Alessandro Armando
    • Enrico Giunchiglia

    OriginalPaper Pages: 475 - 502

15. Call for papers

    Announcement Pages: I - II