5. ICLP / SLP 1988: Seattle, Washington

Robert A. Kowalski, Kenneth A. Bowen: Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988. MIT Press 1988, ISBN 0-262-61056-6 (2 Volumes)

Applications

Pier Giorgio Bosco, C. Cecchi, Corrado Moiso: Exploiting the Full Power of Logic Plus Functional Programming. 3-17
Carl McCrosky, Anthony J. Kusalik: Improving First-Class Array Expressions Using Prolog. 18-25
Toramatsu Shintani: A Fast Prolog-Based Production System KORE/IE. 26-41
Mehmet Dincbas, Helmut Simonis, Pascal Van Hentenryck: Solving a Cutting-Stock Problem in Constraint Logic Programming. 42-58
Tien Huynh, Catherine Lassez: A CLP(R) Options Trading Analysis System. 59-69
Peter B. Reintjes: A VLSI Design Environment in PROLOG. 70-81
Thomas W. G. Docker: SAME - A Structured Analysis Tool and its Implementation in Prolog. 82-95
Kevin Steer: Testing Data Flow Diagrams with PARLOG. 96-110

Constructive Negation

David Chan: Constructive Negation Based on the Completed Database. 111-125
Norman Y. Foo, Anand S. Rao, Andrew Taylor, Adrian Walker: Deduced Relevant Types and Constructive Negation. 126-139

Databases

Raghu Ramakrishnan: Magic Templates: A Spellbinding Approach to Logic Programs. 140-159
I. Attila, Paul Franchi-Zannettacci: Unification-Free Execution of TYPOL Programs by Semantic Attribute Evaluation. 160-177
David B. Kemp, Rodney W. Topor: Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases. 178-194
Hirohisa Seki, Hidenori Itoh: A Query Evaluation Method for Stratified Programs Under the Extended CWA. 195-211

Grammar and Parsing

R. Trehan, P. F. Wilk: A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages. 212-232
Harvey Abramson: Metarules and an Approach to Conjunction in Definite Clause Translation Grammars: Some Aspects of Grammatical Metaprogramming. 233-248
Verónica Dahl: Representing Linguistic Knowledge through Logic Programming. 249-262
Lynette Hirschman, William C. Hopkins, Robert C. Smith: OR-Parallel Speed-Up in Natural Language Processing: A Case Study. 263-279

Logic and Functional Programming

Jean H. Gallier, Tomás Isakowitz: Rewriting in Order-sorted Equational Logic. 280-294
Joseph L. Zachary: A Pragmatic Approach to Equational Logic Programming. 295-310
Staffan Bonnier, Jan Maluszynski: Towards a Clean Amalgamation of Logic Programs with External Procedures. 311-326
Steffen Hölldobler: From Paramodulation to Narrowing. 327-342

Meta-Programming

A. Bruffaerts, E. Henin: Proof Trees for Negation as Failure: Yet Another Prolog Meta-Interpreter. 343-358
Patrizia Coscia, Paola Franceschi, Giorgio Levi, Giuseppe Sardu, Luigia Torre: Meta-Level Definition and Compilation of Inference Engines in the Epsilon Logic Programming Environment. 359-373
Chor Sang Kwok, Marek J. Sergot: Implicit Definition of Logic Programs. 374-385
Leon Sterling, Arun Lakhotia: Composing Prolog Meta-Interpreters. 386-403

Objects

Weidong Chen, David Scott Warren: Objects as Intensions. 404-419
John S. Conery: Logical Objects. 420-434

Problem-Solving and Novel Techniques

Jonas Barklund, Nils Hagner, Malik Wafin: Condition Graphs. 435-446
Christian Codognet, Philippe Codognet, Gilberto Filé: Yet Another Intelligent Backtracking Method. 447-465
Sei-ichi Kondoh, Takashi Chikayama: Macro Processing in Prolog. 466-480

Programming Environments

Luís Moniz Pereira, Miguel Calejo: A Framework for Prolog Debugging. 481-495
Dave Plummer: Coda: An Extended Debugger for PROLOG. 496-511
Yossi Lichtenstein, Ehud Y. Shapiro: Abstract Algorithmic Debugging. 512-531
Mike Brayshaw, Marc Eisenstadt: Adding Data and Procedure Abstraction to the Transparent Prolog Machine TPM. 532-547
Michael M. Gorlick, Carl Kesselman: Gauge: A Workbench for the Performance Analysis of Logic Programs. 548-561

Temporal Reasoning

Kave Eshghi: Abductive Planning with Event Calculus. 562-579

Types

Paul J. Voda: Types of Trilogy. 580-589
Maarten H. van Emden: Conditional Answers for Polymorphic Type Inference. 590-603
Jiyang Xu, David Scott Warren: A Type Inference System for Prolog. 604-619

Unification and Constraints

Douglas Stott Parker Jr., Richard R. Muntz: A Theory of Directed Logic Programs and Streams. 620-650
Graeme S. Port: A Simple Approach to Finding the Cause of Non-Unifiability. 651-665

Abstract Interpretation and Data Dependency

Maurice Bruynooghe, Gerda Janssens: An Instance of Abstract Interpretation Integrating Type and Mode Inferencing. 669-683
Richard Warren, Manuel V. Hermenegildo, Saumya K. Debray: On the Practicality of Global Flow Analysis of Logic Programs. 684-699 , long version: JLP 13: 349-366 (1992)
Annika Wærn: An Implementation Technique for the Abstract Interpretation of Prolog. 700-710
Saumya K. Debray: Static Analysis of Parallel Logic Programs. 711-732
Kim Marriott, Harald Søndergaard: Bottom-up Abstract Interpretation of Logic Programs. 733-748
William H. Winsborough, Annika Wærn: Transparent And-Parallelism in the Presence of Shared Free Variables. 749-764

Complexity

Krzysztof R. Apt, Howard A. Blair: Arithmetic Classification of Perfect Models of Stratified Programs. 765-779
S. Kaplan: Algorithmic Complexity of Logic Programs. 780-793

Extensions and Variations of LP

Bruce T. Smith, Donald W. Loveland: A Simple Near-Horn Prolog Interpreter. 794-809
Gopalan Nadathur, Dale Miller: An Overview of Lambda-PROLOG. 810-827
Jorge Lobo, Jack Minker, Arcot Rajasekar: Weak Completion Theory for Non-Horn Programs. 828-842
Bharat Jayaraman, Anil Nair: Subset-Logic Programming: Application and Implementation. 843-858

Miscellaneous Theory

M. A. Nait Abdallah: Heuristic Logic and the Process of Discovery. 859-875

Reasoning about Programs

Charles Elkan, David A. McAllester: Automated Inductive Reasoning about Logic Programs. 876-892
Laurent Fribourg: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. 893-908
Kim Marriott, Lee Naish, Jean-Louis Lassez: Most Specific Logic Programs. 909-923
Hiroshi Fujita, Akira Okumura, Koichi Furukawa: Partial Evaluation of GHC Programs Based on the UR-set with Constraints. 924-941
John Hannan, Dale Miller: Uses of Higher-Order Unification for Implementing Program Transformers. 942-959

Semantic Issues

Aïda Batarekh, V. S. Subrahmanian: Semantical Equivalences of (Non-Classical) Logic Programs. 960-977
Kenneth Kunen: Some Remarks on the Completed Database. 978-992
Moreno Falaschi, Giorgio Levi, Maurizio Martelli, Catuscia Palamidessi: A New Declarative Semantics for Logic Languages. 993-1005
Paolo Mancarella, Dino Pedreschi: An Algebra of Logic Programs. 1006-1023
Stan Raatz, Jean H. Gallier: A Relational Semantics for Logic Programming. 1024-1035
V. S. Subrahmanian: Intuitive Semantics for Quantitative Rule Sets. 1036-1053

Semantics of Negation

Melvin Fitting, Marion Ben-Jacob: Stratified and Three-valued Logic Programming Semantics. 1054-1069
Michael Gelfond, Vladimir Lifschitz: The Stable Model Semantics for Logic Programming. 1070-1080
Teodor C. Przymusinski: Perfect Model Semantics. 1081-1096
Yves Moinard: Pointwise Circumscription is Equivalent to Predicate Completion (Sometimes). 1097-1105
Halina Przymusinska, Teodor C. Przymusinski: Weakly Perfect Model Semantics for Logic Programs. 1106-1120

AND-Parallelism

Yow-Jian Lin, Vipin Kumar: AND-Parallel Execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results. 1123-1141
Zoltan Somogyi, Kotagiri Ramamohanarao, Jayen Vaghani: A Stream AND-Parallel Execution Algorithm with Backtracking. 1142-1159

AND/OR-Parallelism

Prasenjit Biswas, Shyh-Chang Su, David Y. Y. Yun: A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs. 1160-1179
K. W. Ng, Ho-Fung Leung: The Competition Model for Parallel Execution of Logic Programs. 1180-1187
Prabhakaran Raman, Eugene W. Stark: Fully Distributed, AND/OR-Parallel Execution of Logic Problems. 1188-1203
Chien-Chao Tseng, Prasenjit Biswas: A Data-Driven Parallel Execution Model for Logic Programs. 1204-1222
Laxmikant V. Kalé, R. Ramkumar, Wei Shu: A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs. 1223-1240

Concurrent Systems

Atsuhiro Goto, Yasunori Kimura, T. Nakagawa, Takashi Chikayama: Lazy Reference Counting: An Incremental Garbage Collection Method for Parallel Inference Machines. 1241-1256
Hamish Taylor: Localizing the GHC Suspension Test. 1257-1271
Handong Wu: An Extended Dataflow Model of FGHC. 1272-1276
Leon Alkalaj, Ehud Y. Shapiro: An Architectural Model for a Flat Concurrent Prolog Processor. 1277-1297
Vijay A. Saraswat: A Somewhat Logical Formulation of CLP Synchronisation Primitives. 1298-1314
Shmuel Klinger, Ehud Y. Shapiro: A Decision Tree Compilation Algorithm for FCP(!, : , ?). 1315-1336
Martin Nilsson, Hidehiko Tanaka: A Flat GHC Implementation for Supercomputers. 1337-1350
Sven-Olof Nyström: Control Structures for Guarded Horn Clauses. 1351-1370

Implementation

Hamid Bacha: Meta Prolog Design and Implementation. 1371-1387
Gerda Janssens, Bart Demoen, André Mariën: Improving the Register Allocation of WAM by Recording Unification. 1388-1402
Jonathan Wayne Mills, Kevin A. Buettner: Assertive Demons. 1403-1414
D. A. Chu, F. G. McCabe: SWIFT: A New Symbolic Processor. 1415-1427
Subash Shankar: A Hierarchical Associative Memory Architecture for Logic Programming Unification. 1428-1447
C. D. Stormon, M. R. Brule, J. V. Oldfield, D. F. Ribeiro: An Architecture Based on Content-Addressable Memory for the Rapid Execution of Prolog. 1448-1473
David Hemmendinger: A Compiler and Semantic Analyzer Based on Categorial Grammar. 1474-1489
Feliks Kluzniak: Compile Time Garbage Collection for Ground Prolog. 1490-1505
Ken-ichi Kurosawa, S. Yamaguchi, Shigeo Abe, Tadaaki Bandoh: Instruction Architecture for a High Performance Integrated Prolog Processor IPP. 1506-1530

Or-Parallelism and Parallel Prolog

Khayri A. M. Ali: OR-Parallel Execution of Prolog on BC-Machine. 1531-1545
Lee Naish: Parallelizing NU-Prolog. 1546-1564
Mats Carlsson, Kenneth J. Danhof, Ross A. Overbeek: A Simplified Approach to the Implementation of AND-Parallelism in an OR-Parallel Environment. 1565-1577
Hiyan Alshawi, Douglas B. Moran: The Delphi Model and Some Preliminary Experiments. 1578-1589
Ralph Butler, Terry Disz, Ewing L. Lusk, Robert Olson, Ross A. Overbeek, Rick L. Stevens: Scheduling OR-Parallelism: An Argonne Perspective. 1590-1605

Invited Talks

Layman E. Allen, Charles S. Saxon: Multiple Interpretations of the Logical Structure of Legal Rules: Impediment or Boon to Legal Expert Systems? 1609-1623
Alan Bundy: A Broader Interpretation of Logic in Logic Programming. 1624-1648
Giorgio Levi: Models, Unfolding Rules and Fixpoint Semantics. 1649-1665
Carlo Zaniolo: Design and Implementation of a Logic Based Language for Data Intensive Applications. 1666-1687