default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 171
Volume 171, Numbers 1-2, 15 January 1997
- Laks V. S. Lakshmanan:
Preface. 1-2 - Giorgio Ausiello, Roberto Giaccio:
On-Line Algorithms for Satisfiability Problems with Uncertainty. 3-24 - Manolis Koubarakis
:
The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases. 25-60 - Paul Ruet, François Fages:
Combining Explicit Negation and Negation by Failure Via Belnap's Logic. 61-75 - Bamshad Mobasher, Don Pigozzi, Giora Slutzki:
Multi-Valued Logic Programming Semantics: An Algebraic Approach. 77-109 - Anil Nerode, Jeffrey B. Remmel, V. S. Subrahmanian:
Annotated Nonmonotonic Rule Systems. 111-146 - Liem Ngo, Peter Haddawy:
Answering Queries from Context-Sensitive Probabilistic Knowledge Bases. 147-177 - Esteban Zimányi:
Query Evaluation in Probabilistic Relational Databases. 179-219 - Jürg Kohlas:
Allocation of Arguments and Evidence Theory. 221-246 - Philippe Chatalic, Christine Froidevaux, Camilla Schwind:
Graded Hypothesis Theories. 247-280 - Patrick Bosc, Didier Dubois, Olivier Pivert, Henri Prade:
Flexible Queries in Relational Databases - The Example of the Division Operator. 281-302
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-01 23:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
