The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1996, volume: 160, number: 1&2

  1. Roger D. Maddux
    Relation-Algebraic Semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:1-85 [Journal]
  2. Bruno Courcelle
    The Monadic Second-Order Logic of Graphs X: Linear Orderings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:87-143 [Journal]
  3. Enrico Tronci
    Equational Programming in Lambda-Calculus via SL-Systems. Part 1. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:145-184 [Journal]
  4. Enrico Tronci
    Equational Programming in Lambda-Calculus via SL-Systems. Part 2. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:185-216 [Journal]
  5. Chris Tuijn, Marc Gyssens
    CGOOD, a Categorical Graph-Oriented Object Data Model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:217-239 [Journal]
  6. Matthias Baaz, Alexander Leitsch, Richard Zach
    Completeness of a First-Order Temporal Logic with Time-Gaps. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:241-270 [Journal]
  7. Michael Kaminski, Chung Kei Wong
    The Power of the "Always" Operator in First-Order Temporal Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:271-281 [Journal]
  8. Susumu Yamasaki
    SLDNF Resolution with Non-Safe Rule and Fixpoint Semantics for General Logic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:283-303 [Journal]
  9. Arnaud Durand, Solomampionona Ranaivoson
    First-Order Spectra with one Binary Predicate. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:305-320 [Journal]
  10. Piero A. Bonatti, Thomas Eiter
    Querying Disjunctive Databases Through Nonmonotonic Logics. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:321-363 [Journal]
  11. Kim Marriott, Martin Odersky
    Negative Boolean Constraints. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:160, n:1&2, pp:365-380 [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