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=206
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Unification with extended patterns
Dominic Duggan
Theoretical Computer Science
206
(1-2), 1998, pp. 1-50
A semantics for modular general logic programs
Sandro Etalle
Theoretical Computer Science
206
(1-2), 1998, pp. 51-80
Transforming constraint logic programs
N. Bensaou
,
I. Guessarian
Theoretical Computer Science
206
(1-2), 1998, pp. 81-125
Partial confluence of processes and systems of objects
Xinxin Liu
,
David Walker
Theoretical Computer Science
206
(1-2), 1998, pp. 127-162
Theorem proving by chain resolution
Patrick Dehornoy
,
Abderrahim Marzouk
Theoretical Computer Science
206
(1-2), 1998, pp. 163-180
Expressive power and complexity of partial models for disjunctive deductive databases
Thomas Eiter
,
Nicola Leone
,
Domenico Saccá
Theoretical Computer Science
206
(1-2), 1998, pp. 181-218
A uniform approach to true-concurrency and interleaving semantics for Petri nets
Lutz Priese
,
Harro Wimmel
Theoretical Computer Science
206
(1-2), 1998, pp. 219-256
Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
Susumu Yamasaki
,
Yoshinori Kurose
Theoretical Computer Science
206
(1-2), 1998, pp. 257-281
Axiomatisation of functional dependencies in incomplete relations
Mark Levene
,
George Loizou
Theoretical Computer Science
206
(1-2), 1998, pp. 283-300
System T, call-by-value and the minimum problem
Loïc Colson
,
Daniel Fredholm
Theoretical Computer Science
206
(1-2), 1998, pp. 301-315
Unary PCF is decidable
Ralph Loader
Theoretical Computer Science
206
(1-2), 1998, pp. 317-329
Infiniteness of proof
(\alpha)
is polynomial-space complete
Sachio Hirokawa
Theoretical Computer Science
206
(1-2), 1998, pp. 331-339
Proving possibility properties
Leslie Lamport
Theoretical Computer Science
206
(1-2), 1998, pp. 341-352