Theoretical Computer Science, Volume 166

Volume 166, Numbers 1&2, 20 October 1996

• Y. S. Ramakrishna, P. M. Melliar-Smith, Louise E. Moser, Laura K. Dillon, G. Kutty:
  Interval Logics and Their Decision Procedures, Part I: An Interval Logic. 1-47
  
• Uchang Park:
  An Algebraic Formulation of the Aggregative Closure Query. 49-62
  
• Enshao Shen, Qijia Tian:
  Monadic Partition Logics and Finite Automata. 63-81
  
• R. Hoofman:
  Comparing Models of the Intensional Typed Lambda-Calculus. 83-99
  
• Sandro Etalle, Maurizio Gabbrielli:
  Transformations of CLP Modules. 101-146
  
• Jean-Denis Fouks, Jean-Claude Spehner:
  Meta-Resolution: An Algorithmic Formalisation. 147-172
  
• Stéphane Demri, Ewa Orlowska:
  Logical Analysis of Demonic Nondeterministic Programs. 173-202
  
• Guo-Qiang Zhang:
  The Largest Cartesian Closed Category of Stable Domains. 203-219
  
• Georg Gottlob, Sherry Marcus, Anil Nerode, Gernot Salzer, V. S. Subrahmanian:
  A Non-Ground Realization of the Stable and Well-Founded Semantics. 221-262
  
• Karl Meinke:
  Topological Methods for Algebraic Specification. 263-290
  
• Anatoli Degtyarev, Andrei Voronkov:
  The Undecidability of Simultaneous Rigid E-Unification. 291-300