Theoretical Computer Science, Volume 206

Volume 206, Numbers 1-2, 6 October 1998

• Dominic Duggan:
  Unification with Extended Patterns. 1-50
  Electronic Edition (link) BibTeX
• Sandro Etalle:
  A Semantics for Modular General Logic Programs. 51-80
  Electronic Edition (link) BibTeX
• N. Bensaou, Irène Guessarian:
  Transforming Constraint Logic Programs. 81-125
  Electronic Edition (link) BibTeX
• Xinxin Liu, David Walker:
  Partial Confluence of Proceses and Systems of Objects. 127-162
  Electronic Edition (link) BibTeX
• Patrick Dehornoy, Abderrahim Marzouk:
  Theorem Proving by Chain Resolution. 163-180
  Electronic Edition (link) BibTeX
• Thomas Eiter, Nicola Leone, Domenico Saccà:
  Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. 181-218
  Electronic Edition (link) BibTeX
• Lutz Priese, Harro Wimmel:
  A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. 219-256
  Electronic Edition (link) BibTeX
• Susumu Yamasaki, Yoshinori Kurose:
  Soudness of Abductive Proof Procedure with Respect to Constraint for Non-Ground Abducibles. 257-281
  Electronic Edition (link) BibTeX
• Mark Levene, George Loizou:
  Axiomatisation of Functional Dependencies in Incomplete Relations. 283-300
  Electronic Edition (link) BibTeX
• Loïc Colson, Daniel Fredholm:
  System T, Call-by-Value and the Minimum Problem. 301-315
  Electronic Edition (link) BibTeX
• Ralph Loader:
  Unary PCF is Decidable. 317-329
  Electronic Edition (link) BibTeX
• Sachio Hirokawa:
  Infiniteness of Proof(alpha) is Polynomial-Space Complete. 331-339
  Electronic Edition (link) BibTeX
• Leslie Lamport:
  Proving Possibility Properties. 341-352
  Electronic Edition (link) BibTeX
• Guy Perrier:
  Corrigendum to Galmiche's and Perrier's ``On Proof Normalization in Linear Logic''. 353-354
  Electronic Edition (link) BibTeX