Theoretical Computer Science 1996: Vol 166 Table of Contents

1 Pages·1996·0.11 MB·English

THEORETICAL COMPUTER SCIENCE
Logic, semantics and theory of programming
VOLUME 166, NUMBERS 1-2, 20 OCTOBER 1996
Abstracted/Indexed in: ACM Computing Reviews, Compuscience, Computer Abstracts,
Current Contents: Engineering, Technology & Applied Science, Engineering Index/Com-
pendex, INSPEC Information Services, Mathematical Reviews, Zentralblatt fur Mathematik
CONTENTS
Fundamental Study
Y.S. Ramakrishna, P.M. Melliar-Smith, L.E. Moser, L.K. Dillon and G. Kutty
Interval logics and their decision procedures. Part |: An interval logic
Regular Papers
U. Park
An algebraic formulation of the aggregative closure query
E. Shen and Q. Tian
Monadic partition logics and finite automata
R. Hoofman
Comparing models of the intensional typed A-calculus
S. Etalle and M. Gabbrielli
Transformations of CLP modules
J.-D. Fouks and J.-C. Spehner
Meta-resolution: An algorithmic formalisation
S. Demri and E. Ortowska
Logical analysis of demonic nondeterministic programs
G.-Q. Zhang
The largest cartesian closed category of stable domains
G. Gottlob, S. Marcus, A. Nerode, G. Salzer and V.S. Subrahmanian
A non-ground realization of the stable and well-founded semantics
K. Meinke
Topological methods for algebraic specification
Note
A. Degtyarev and A. Voronkov
The undecidability of simultaneous rigid E-unification
Author Index Volume 166