Theoretical Computer Science

Interval logics and their decision procedures - Part I: An interval logic
pp. 1-47(47)
Authors: Ramakrishna Y.S.; Melliar-Smith P.M.; Moser L.E.; Dillon L.K.; Kutty G.

Parallel constructions of maximal path sets and applications to short superstrings
pp. 12-12(1)
Author: Zhi-Zhong C.

The complexity of PDL with interleaving
pp. 12-12(1)
Authors: Mayer A.J.; Stockmeyer L.J.

On the language of primitive words
pp. 12-12(1)
Author: Petersen H.

Generalized Knapsack problems and fixed degree separations
pp. 12-12(1)
Authors: Cucker F.; Shub M.

Constructing the highest subgraph for dense graphs is in NCAL
pp. 12-12(1)
Authors: Andreev A.E.; Clementi A.E.F.; Rolim J.D.P.

An algebraic formulation of the aggregative closure query
pp. 49-62(14)
Author: Park U.

Monadic partition logics and finite automata
pp. 63-81(19)
Authors: Enshao S.; Qijia T.

Comparing models of the intensional typed -calculus
pp. 83-99(17)
Author: Hoofman R.

Transformations of CLP modules
pp. 101-146(46)
Authors: Etalle S.; Gabbrielli M.

Meta-resolution: An algorithmic formalisation
pp. 147-172(26)
Authors: Fouks J.-D.; Spehner J.-C.

Logical analysis of demonic nondeterministic programs
pp. 173-202(30)
Authors: Demri S.; Orlowska E.

The largest cartesian closed category of stable domains
pp. 203-219(17)
Author: Guo-Qiang Z.

A non-ground realization of the stable and well-founded semantics
pp. 221-262(42)
Authors: Gottlob G.; Marcus S.; Nerode A.; Salzer G.; Subrahmanian V.S.

Topological methods for algebraic specification
pp. 263-290(28)
Author: Meinke K.

The undecidability of simultaneous rigid E-unification
pp. 291-300(10)
Authors: Degtyarev A.; Voronkov A.