Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, August 31 - September 4, 1987. IEEE-CS 1987, ISBN 0-8186-0799-8

Language Issues

• 
  Martín Abadi, Zohar Manna: Temporal Logic Programming. 4-16
• 
  Hassan Aït-Kaci, Patrick Lincoln, Roger Nasr: Le Fun: Logic, Equations and Functions. 17-23
• 
  Weidong Chen: A Theory of Modules Based on Second-Order Logic. 24-33
• 
  Martin Huber, Igor Varsek: Extended Prolog for Order-Sorted Resolution. 34-43

Parallelism in Prolog

• 
  Terry Disz, Ewing L. Lusk: A Graphical Tool for Observing the Behavior of Parallel Logic Programs. 46-53
• 
  Kish Shen, David H. D. Warren: A Simulation Study of the Argonne Model for Or-Parallel Execution of Prolog. 45-68
• 
  Bogumil Hausman, Andrzej Ciepielewski, Seif Haridi: OR-Parallel Prolog Made Efficient on Shared Memory Multiprocessors. 69-79
• 
  Doug DeGroot: Restricted And-Parallelism and Side Effects. 80-89

Inivted Talk

• 
  David H. D. Warren: The SRI Model for Or-Parallel Execution of Prolog: Abstract Design and Implementation Issues. 92-102

Architecture, Parallel Models

• 
  Hiroshi Nakashima, Katsuto Nakajima: Hardware Architecture of the Sequential Inference Machine: PSI-II. 104-113
• 
  Hervé J. Touati, Alvin M. Despain: An Empirical Study of the Warren Abstract Machine. 114-124
• 
  Laxmikant V. Kalé: 'Completeness' and 'Full Parallelism' of Parallel Logic Programming Schemes. 125-133
• 
  William H. Winsborough: Semantically Transparent Selective Reset for AND Parallel Interpreters Based on the Origin of Failures. 134-152

Theory, Semantics

• 
  Howard A. Blair: Canoncical Conservative Extensions of Logic Program Completions. 154-161
• 
  Pierre Deransart, Gérard Ferrand: An Operational Formal Definition of PROLOG. 162-172
• 
  V. S. Subrahmanian: On the Semantics of Quantitative Logic Programs. 173-182
• 
  Philip T. Cox, Tomasz Pietrzykowski: General Diagnosis by Abductive Inference. 183-189

Program Analysis, Methodology

• 
  Maurice Bruynooghe, Gerda Janssens, Alain Callebaut, Bart Demoen: Abstract Interpretation: Towards the Global Optimization of Prolog Programs. 192-204
• 
  Heikki Mannila, Esko Ukkonen: Flow Analysis of Prolog Programs. 205-214
• 
  Hirohisa Seki, Koichi Furukawa: Notes on Transformation Techniques for Generate and Test Logic Programs. 215-223
• 
  Akira Okumura, Yuji Matsumoto: Parallel Programming with Layered Streams. 224-232

Databases

• 
  Helmut Schmidt, Werner Kießling, Ulrich Güntzer, Rudolf Bayer: Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration. 234-243
• 
  Eyal Mozes: A Deductive Database Based on Aristotelian Logic. 244-252
• 
  Mark Wallace: Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases. 253-263
• 
  Suzanne W. Dietrich: Extension Tables: Memo Relations in Logic Programming. 264-272

Invited Talk

• 
  Takashi Chikayama: Parallel Inference System Researches in the FGCS Project. 274-276

Program Development

• 
  Yukihide Takayama: Writing Programs as QJ Proof and Compiling into Prolog Programs. 278-287
• 
  Matthew M. Huntbach: Algorithmic PARLOG Debugging. 288-297
• 
  Nachum Dershowitz, Yuh-Jeng Lee: Deductive Debugging. 298-306
• 
  Saumya K. Debray: Flow Analysis of a Simple Class of Dynamic Logic Programs. 307-316

Semantics, Languages

• 
  Giorgio Levi, Catuscia Palamidessi, Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso: A Complete Semantic Characterization of K-Leaf: A Logic Language with Partial Functions. 318-327
• 
  D. W. Shin, Jong H. Nang, Sangki Han, Seungryul R. Maeng: A Functional Logic Language Based on Canonical Unification. 328-334
• 
  Steffen Hölldobler: Equational Logic Programming. 335-346
• 
  Vijay A. Saraswat: GHC: Operational Semantics, Problems, and Relationships with CP(|, |). 347-358

Methodology

• 
  Walter G. Wilson: Concurrent Alpha-Beta: A Study in Concurrent Logic Programming. 360-367
• 
  Donald Sannella, Lincoln A. Wallen: A Calculus for the Construction of Modular Prolog Programs. 368-378
• 
  Dale Miller, Gopalan Nadathur: A Logic Programming Approach to Manipulating Formulas and Programs. 379-388
• 
  Wlodzimierz Drabent: Do Logic Programs Resemble Programs in Conventional Languages? 289-396

Implementations

• 
  Chenxi Zhang, Tzu Yungui, Li Liangliang, Hu Yunfa: Implementation of a Prolog Code Database and Source Database in Compiler-Based Systems. 398-405
• 
  Vipin Kumar, Yow-Jian Lin: An Intelligent Backtracking Scheme for Prolog. 406-414
• 
  Jonas Barklund, Håkan Millroth: Integrating Complex Data Structures in Prolog. 415-425
• 
  Michael M. Gorlick, Carl Kesselman: Timing Prolog Programs without Clock. 426-434

Parallel Machines

• 
  Harald Westphal, Philippe Robert, Jacques Chassin de Kergommeaux, Jean-Claude Syre: The PEPSys Model: Combining Backtracking, AND- and OR-Parallelism. 436-448
• 
  Khayri A. M. Ali: A Method for Implementing Cut in Parallel Execution of Prolog. 449-456
• 
  John S. Conery: Binding Environments for Parallel Logic Programs in Non-Shared Memory Multiprocessors. 457-467
• 
  Yasunori Kimura, Takashi Chikayama: An Abstract KL1 Machine and Its Instruction Set. 468-477

Applications I

• 
  Hayato Ohwada, Fumio Mizoguchi: Qualitative Simulation in Parallel Logic Programming. 480-489
• 
  William R. Bush, Gino Cheng, Patrick C. McGeer, Alvin M. Despain: Experience with Prolog as a Hardware Specification Language. 490-498
• 
  Stan Matwin, Stan Szpakowicz, Gregory E. Kersten, Wojtek Michalowski, Zbig Koperczak: A Logic-Based Tools for Negotiation Support. 499-506

Applications II

• 
  Peter B. Reintjes: AUNT: A Universal Netlist Translator. 508-515
• 
  Mitsuhiro Kishimoto, Akira Hosoi, Kouichi Kumon, Akira Hattori: An Evaluation of the FGHC via Practical Application Programs. 516-525