Theoretical Computer Science, Volume 185

Volume 185, Number 1, 10 October 1997

• John D. Kececioglu, Ming Li, John Tromp:
  Inferring a DNA Sequence from Erroneous Copies. 3-13
  
• Yasubumi Sakakibara:
  Recent Advances of Grammatical Inference. 15-45
  
• Hiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara:
  Learning Unions of Tree Patterns Using Queries. 47-62
  
• Takeshi Koshiba, Erkki Mäkinen, Yuji Takada:
  Learning Deterministic even Linear Languages From Positive Examples. 63-79
  
• Léa Meyer:
  Probabilistic Language Learning Under Monotonicity Constraints. 81-128
  
• Frank Stephan:
  Noisy Inference and Oracles. 129-157
  
• Peter Auer:
  Learning Nested Differences in the Presence of Malicious Noise. 159-175
  
• Eiji Takimoto, Akira Miyashiro, Akira Maruoka, Yoshifumi Sakai:
  Learning Orthogonal F-Horn Formulas. 177-190
  
• M. R. K. Krishna Rao:
  A Framework for Incremental Learning of Logic Programs. 193-213

Volume 185, Number 2, 20 October 1997

• David W. Albrecht, John N. Crossley, John S. Jeavons:
  New Curry-Howard Terms for Full Linear Logic. 217-235
  
• C. Barry Jay:
  Covariant Types. 237-258
  
• Xuemin Lin:
  A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. 259-275
  
• Ian A. Mason:
  A First Order Logic of Effects. 277-318
  
• Mehmet A. Orgun, Weichang Du:
  Multi-Dimensional Logic Programming: Theoretical Foundations. 319-345
  
• Grammati E. Pantziou, Alan Roberts, Antonios Symvonis:
  Many-to-Many Routings on Trees via Matchings. 347-377
  
• Millist W. Vincent:
  A Corrected 5NF Definition for Relational Database Design. 379-391
  
• Trudy Weibel:
  An Order-Sorted Resolution in Theory and Practice. 393-410