Theoretical Computer Science, Volume 104

Volume 104, Number 1, 1992

• Roland N. Bol: Generalizing Completeness Results for Loop Checks in Logic Programming. 3-28
• Jean-Pierre Jouannaud, Claude Marché: Termination and Completion Modulo Associativity, Commutativity and Identity. 29-51
• Rolf Hennicker: A Semi-Algorithm for Algebraic Implementation Proofs. 53-87
• Carla Limongelli, Marco Temperini: Abstract Specification of Structures and Methods in Symbolic Mathematical Computation. 89-107
• Mark E. Stickel: A Prolog Technology Theorem Prover: A New Exposition and Implementation in Prolog. 109-128
• Carolyn L. Talcott: A Theory for Program and Data Type Specification. 129-159

Volume 104, Number 2, 1992

• Howard Straubing, Pascal Weil: On a Conjecture Concerning Dot-Depth Two Languages. 161-183
• Changwook Kim, Ivan Hal Sudborough: On Reversal-Bounded Picture Languages. 185-206
• Yuji Takada: Learning Semilinear Sets from Examples and via Queries. 207-233
• David J. Weir: A Geometric Hierarchy Beyond Context-Free Languages. 235-261
• Daniel P. Bovet, Pierluigi Crescenzi, Riccardo Silvestri: A Uniform Approach to Define Complexity Classes. 263-283
• Klaus Jansen: Processor Optimization for Flow Graphs. 285-298
• René Leermakers: Recursive Ascent Parsing: From Earley to Marcus. 299-312
• René Leermakers, Lex Augusteijn, F. E. J. Kruseman Aretz: A Functional LR Parser. 313-323