Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=171
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On-line algorithms for satisfiability problems with uncertainty
Giorgio Ausiello
,
Roberto Giaccio
Theoretical Computer Science
171
(1-2), 1997, pp. 3-24
The complexity of query evaluation in indefinite temporal constraint databases
Manolis Koubarakis
Theoretical Computer Science
171
(1-2), 1997, pp. 25-60
Combining explicit negation and negation by failure via Belnap's logic
Paul Ruet
,
François Fages
Theoretical Computer Science
171
(1-2), 1997, pp. 61-75
Multi-valued logic programming semantics: An algebraic approach
Bamshad Mobasher
,
Don Pigozzi
,
Giora Slutzki
Theoretical Computer Science
171
(1-2), 1997, pp. 77-109
Annotated nonmonotonic rule systems
A. Nerode
,
J.B. Remmel
,
V.S. Subrahmanian
Theoretical Computer Science
171
(1-2), 1997, pp. 111-146
Answering queries from context-sensitive probabilistic knowledge bases
Liem Ngo
,
Peter Haddawy
Theoretical Computer Science
171
(1-2), 1997, pp. 147-177
Query evaluation in probabilistic relational databases
Esteban Zimányi
Theoretical Computer Science
171
(1-2), 1997, pp. 179-219
Allocation of arguments and evidence theory
Jürg Kohlas
Theoretical Computer Science
171
(1-2), 1997, pp. 221-246
Graded hypothesis theories
Philippe Chatalic
,
Christine Froidevaux
,
Camilla Schwind
Theoretical Computer Science
171
(1-2), 1997, pp. 247-280
Flexible queries in relational databases - The example of the division operator
Patrick Bosc
,
Diedier Dubois
,
Olivier Pivert
,
Henri Prade
Theoretical Computer Science
171
(1-2), 1997, pp. 281-302