The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1998, volume: 206, number: 1-2

  1. Dominic Duggan
    Unification with Extended Patterns. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:1-50 [Journal]
  2. Sandro Etalle
    A Semantics for Modular General Logic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:51-80 [Journal]
  3. N. Bensaou, Irène Guessarian
    Transforming Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:81-125 [Journal]
  4. Xinxin Liu, David Walker
    Partial Confluence of Proceses and Systems of Objects. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:127-162 [Journal]
  5. Patrick Dehornoy, Abderrahim Marzouk
    Theorem Proving by Chain Resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:163-180 [Journal]
  6. Thomas Eiter, Nicola Leone, Domenico Saccà
    Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:181-218 [Journal]
  7. Lutz Priese, Harro Wimmel
    A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:219-256 [Journal]
  8. Susumu Yamasaki, Yoshinori Kurose
    Soudness of Abductive Proof Procedure with Respect to Constraint for Non-Ground Abducibles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:257-281 [Journal]
  9. Mark Levene, George Loizou
    Axiomatisation of Functional Dependencies in Incomplete Relations. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:283-300 [Journal]
  10. Loïc Colson, Daniel Fredholm
    System T, Call-by-Value and the Minimum Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:301-315 [Journal]
  11. Ralph Loader
    Unary PCF is Decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:317-329 [Journal]
  12. Sachio Hirokawa
    Infiniteness of Proof(alpha) is Polynomial-Space Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:331-339 [Journal]
  13. Leslie Lamport
    Proving Possibility Properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:341-352 [Journal]
  14. Guy Perrier
    Corrigendum to Galmiche's and Perrier's ``On Proof Normalization in Linear Logic''. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:206, n:1-2, pp:353-354 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002