3. SLP 1986: Salt Lake City, Utah

Proceedings of the 1986 Symposium on Logic Programming, Salt Lake City, Utah, September 22-25, 1986. IEEE-CS 1986, ISBN 0-8186-0728-9

The long versions of selected papers were published in a special issue of the Journal of Logic Programming (Volume 6, Numbers 1 & 2, January/March 1989).

Invited Speaker

• W. W. Bledsoe: Some Thoughts on Proof Discovery. 2-10

Applications

• Peter Øhrstrøm, Niels Aalborg: The Logic of Tensed Statements in English - An Application of Logic Programming. 12-19
• Leon Sterling, Randall D. Beer: Incremental Flavor-Mixing of Meta-Interpreters for Expert System Construction. 20-27
• Joe L. Armstrong, Nabiel A. Elshiewy, Robert Virding: The Phoning Philosopher's Problem or Logic Programming for Telecommunications Applications. 28-33

Secondary Storage

• Jorge B. Bocca: EDUCE: A Marriage of Convenience: Prolog and a Relational DBMS. 36-45
• M. L. Ross, Kotagiri Ramamohanarao: Paging Strategy for Prolog Based Dynamic Virtual Memory. 46-57
• Ian T. Foster, Anthony J. Kusalik: A Logical Treatment of Secondary Storage. 58-67

Compilation

• Maurice Bruynooghe, Danny De Schreye, Bruno Krekels: Compiling Control. 70-77
• Saumya K. Debray, David Scott Warren: Automatic Mode Inference for Prolog Programs. 78-88
• Pier Giorgio Bosco, Elio Giovannetti: IDEAL: An Ideal Deductive Applicative Language. 89-94

Invited Speaker

• Sten-Åke Tärnlund: Logic Programming-From a Logic Point of View. 96-103

Theory

• Dale Miller: A Theory of Modules for Logic Programming. 106-114
• P. Hoddinott, E. W. Elcock: PROLOG: Subsumption of Equality Axioms by the Homogeneous Form. 115-126
• Allen Van Gelder: Negation as Failure Using Tight Derivations for General Logic Programs. 127-138

Control

• Thomas Vasak, John Potter: Characterisation of Terminating Logic Programs. 140-147
• Jim A. Crammond: An Execution Model for Committed-Choice Non-Deterministic Languages. 148-158
• Heikki Mannila, Esko Ukkonen: Timestamped Term Representation for Implementing Prolog. 159-165

Unification

• Jean H. Gallier, Stan Raatz: SLD-Resolution Methods for Horn Clauses with Equality Based on E-Unification. 168-179
• Alberto Martelli, Corrado Moiso, Gianfranco Rossi: An Algorithm for Unification in Equational Theories. 180-186
• N. Alan Josephson, Nachum Dershowitz: An Implementation of Narrowing: The RITE Way. 187-197

Parallelism

• Nam Sung Woo, Kwang-Moo Choe: Selecting the Backtrack Literal in the AND/OR Model. 200-210
• Peter Borgwardt, Doris Rea: Distributed Semi-intelligent Backtracking for a Stack-based AND-parallel Prolog. 211-222
• Peyyun Peggy Li, Alain J. Martin: The Sync Model: A Parallel Execution Method for Logic Programming. 223-234

Performance

• Jeffrey F. Naughton: Redundancy in Function-Free Recursive Rules. 236-245
• Andrzej Ciepielewski, Bogumil Hausman: Performance Evaluation of a Storage Model for OR--Parallel Execution of Logic Programs. 246-257
• Yves Bekkers, Bernard Canet, Olivier Ridoux, Lucien Ungaro: MALI: A Memory with a Real-time Garbage Collector for Implementing Logic Programming Languages. 258-264

Warren Abstract Machine

• Saumya K. Debray: Register Allocation in a Prolog Machine. 267-275
• Jonas Barklund, Håkan Millroth: Garbage Cut for Garbage Collection of Iterative Prolog Programs. 276-283

Last update Sat May 25 19:06:09 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page