Theoretical Computer Science, Volume 171

Volume 171, Numbers 1-2, 15 January 1997

• Laks V. S. Lakshmanan:
  Preface. 1-2
  Electronic Edition (link) BibTeX
• Giorgio Ausiello, Roberto Giaccio:
  On-Line Algorithms for Satisfiability Problems with Uncertainty. 3-24
  Electronic Edition (link) BibTeX
• Manolis Koubarakis:
  The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. 25-60
  Electronic Edition (link) BibTeX
• Paul Ruet, François Fages:
  Combining Explicit Negation and Negation by Failure Via Belnap's Logic. 61-75
  Electronic Edition (link) BibTeX
• Bamshad Mobasher, Don Pigozzi, Giora Slutzki:
  Multi-Valued Logic Programming Semantics: An Algebraic Approach. 77-109
  Electronic Edition (link) BibTeX
• Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian:
  Annotated Nonmonotonic Rule Systems. 111-146
  Electronic Edition (link) BibTeX
• Liem Ngo, Peter Haddawy:
  Answering Queries from Context-Sensitive Probabilistic Knowledge Bases. 147-177
  Electronic Edition (link) BibTeX
• Esteban Zimányi:
  Query Evaluation in Probabilistic Relational Databases. 179-219
  Electronic Edition (link) BibTeX
• Jürg Kohlas:
  Allocation of Arguments and Evidence Theory. 221-246
  Electronic Edition (link) BibTeX
• Philippe Chatalic, Christine Froidevaux, Camilla Schwind:
  Graded Hypothesis Theories. 247-280
  Electronic Edition (link) BibTeX
• Patrick Bosc, Didier Dubois, Olivier Pivert, Henri Prade:
  Flexible Queries in Relational Databases - The Example of the Division Operator. 281-302
  Electronic Edition (link) BibTeX