Abstract is missing.
- Logic for Knowledge RepresentationRobert A. Kowalski. 1-12
- Logical Specification and ImplementationT. S. E. Maibaum, M. R. Sadler, Paulo A. S. Veloso. 13-30
- Process Specification of Logic ProgramsRamaswamy Ramanujam, R. K. Shyamasundar. 31-43
- Functional Programming Sytem RevisitedAsis K. Goswami, Lalit M. Patnaik. 44-59
- Models and Transformations for Nondeterministic Extensions of Functional ProgrammingThomas J. Myers, A. Toni Cohen. 60-88
- Degrees of Non-Determinism and Concurrency: A Petri Net ViewMogens Nielsen, P. S. Thiagarajan. 89-117
- Proof Rules for Communication Abstractions (Abstract)Gadi Taubenfeld, Nissim Francez. 118
- A Distributed Algorithm for Detecting Communication DeadlocksN. Natarajan. 119-135
- On the Existence and Construction of Robust Communication Protocals for Unreliable ChannelsSaumya K. Debray, Ariel J. Frank, Scott A. Smolka. 136-151
- Heuristic Search Approach to Optimal Routing in a Distributed ArchitectureBhargab B. Bhattacharya, Suranjan Ghose, Bhabani P. Sinha, Pradip K. Srimani. 152-164
- Replacement in Monotone Boolean Networks: An Algebraic PerspectiveMeurig Beynon. 165-178
- A New Characterization of BPPStathis Zachos. 179-187
- Treating Terminals as Function Values of TimeKamala Krithivasan. 188-201
- Logics of Knowledge, Games and Dynamic LogicRohit Parikh. 202-222
- Persistent First Class Procedures are EnoughMalcolm P. Atkinson, Ronald Morrison. 223-240
- Abstraction Concepts for Modeling Screen Oriented Dialogue InterfacesRudi Studer. 241-258
- VLSI Systems For Design Rule ChecksRajiv Kane, Sartaj Sahni. 259-278
- Bounds on the Length of Convex Partitions of PolygonsChristos Levcopoulos, Andrzej Lingas. 279-295
- On Mapping Cube Graphs onto VLSI ArraysI. V. Ramakrishnan. 296-316
- A Linear-Time Algorithm for Determining the Intersection Type of Two Star PolygonsSubir Kumar Ghosh. 317-330
- Eliminating Cascading Rollback in Structured DatabaseGael N. Buckley, Abraham Silberschatz. 331-343
- Recognition and Top-Down Generation of beta-Acyclic Database SchemesV. S. Lakshmanan, N. Chandrasekaran, C. E. Veni Madhavan. 344-366
- Universal and Representative Instances Using Unmarked NullsSushil Jajodia. 367-378
- On Some Computational Problems Related to Data Base Coding (Abstract)F. de Santis, Maria I. Sessa. 379
- Generic Oracles (Abstract)Bruno Poizat. 380
- Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free GraphsC. E. Veni Madhavan. 381-392
- Grid File Algorithms: An Analysis in the Biased CaseMireille Régnier. 393-418
- On the Mean Weight Balance Factor of Binary TreesAsim K. Pal, A. Bagchi. 419-434
- An Efficient Algorithm for Random Sampling without ReplacementP. Gupta, G. P. Bhattacharjee. 435-465