Table of Contents:
  • Topological Semantics for Hybrid Systems / S. Artemov, J. Davoren and A. Nerode
  • Domain-Free Pure Type Systems / G. Barthe and M.H. Sorensen
  • Generic Queries over Quasi-o-minimal Domains / O.V. Belegradek, A.P. Stolboushkin and M.A. Taitslin
  • Towards Computing Distances Between Programs via Scott Domains / M.A. Bukatin and J.S. Scott
  • A Safe Recursion Scheme for Exponential Time / P. Clote
  • Finite Model Theory, Universal Algebra and Graph Grammars / B. Courcelle
  • Complexity of Query Answering in Logic Databases with Complex Values / E. Dantsin and A. Voronkov
  • Recognition of Deductive Data Base Stability / M.I. Dekhtyar and A. Ja. Dikovsky
  • The Concurrency Complexity for the Horn Fragment of Linear Logic / S.M. Dudakov
  • Studying Algorithmic Problems for Free Semi-groups and Groups / V. Durnev
  • Learning Small Programs with Additional Information / R. Freivalds, G. Tervits and R. Wiehagen [and others].