3. ICLP 1986: London

Ehud Y. Shapiro (Ed.): Third International Conference on Logic Programming, Imperial College of Science and Technology, London, United Kingdom, July 14-18, 1986, Proceedings. Lecture Notes in Computer Science 225 Springer 1986, ISBN 3-540-16492-8

Keynote Address

Kazuhiro Fuchi, Koichi Furukawa:
The Role of Logic Programming in the Fifth Generation Computer Project. 1-24

Parallel Implementations

Manuel V. Hermenegildo:
An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs. 25-39
Manuel V. Hermenegildo, R. I. Nasr:
Efficient Management of Backtracking in AND-Parallelism. 40-54
Yow-Jian Lin, Vipin Kumar, Clement H. C. Leung:
An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs. 55-68
Luís Moniz Pereira, Luís Monteiro, José C. Cunha, Joaquim Nunes Aparício:
Delta Prolog: A Distributed Backtracking Extension with Events. 69-83

Theory and Complexity

Hisao Tamaki, Taisuke Sato:
OLD Resolution with Tabulation. 84-98
Petr Stepánek, Olga Stepánková:
Logic Programs and Alternation. 99-106
David A. Wolfram:
Intractable Unifiability Problems and Backtracking. 107-121
Heikki Mannila, Esko Ukkonen:
On the Complexity of Unification Sequences. 122-133

Implementations and Architectures

Peter Kursawe:
How to Invent a Prolog Machine. 134-148
Ian T. Foster, Steve Gregory, Graem A. Ringwood, Ken Satoh:
A Sequential Implementation of Parlog. 149-156
Jacob Levy: A GHC Abstract Machine and Instruction Set. 157-171
Ian Robinson:
A Prolog Processor Based on a Pattern Matching Memory Device. 172-179

Inductive Inference and Debugging

Matthew M. Huntbach:
An Improvised Version of Shapiro's Model Inference System. 180-187
Kazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho, Jun'ichi Toyoda:
A Framework for ICAI Systems Based on Inductive Inference and Logic Programming. 188-202
Luís Moniz Pereira:
Rational Debugging in Logic Programming. 203-210
Randy Goebel, Koichi Furukawa, David Poole:
Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic Reasoning. 211-222

Invited Talks

Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher:
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming. 223-241
Akikazu Takeuchi, Koichi Furukawa:
Parallel Logic Programming Languages. 242-254

Concurrent Logic Languages

Rong Yang, Hideo Aiso:
P-Prolog: A Parallel Logic Language Based on Exclusive Relation. 255-269
Kazunori Ueda:
Making Exhaustive Search Programs Deterministic. 270-282
Michael Codish, Ehud Y. Shapiro:
Compiling OR-parallelism into AND-parallelism. 283-297
Jacob Levy:
Shared Memory Execution of Committed-choice Languages. 298-312

Theory and Semantics

Joxan Jaffar, Peter J. Stuckey:
Logic Program Semantics for Programming with Equations. 313-326
Alberto Martelli, Gianfranco Rossi:
On the Semantics of Logic Programing Languages. 327-334
Lennart Beckman:
Towards a Formal Semantics for Concurrent Logic Programming Languages. 335-349

Invited Talk

Michael C. McCord:
Design of a Prolog-Based Machine Translation System. 350-374

Parallel Applications and Implementations

Ralph Butler, Ewing L. Lusk, William McCune, Ross A. Overbeek:
Parallel Logic Programming for Numeric Applications. 375-388
Harvey Abramson:
Sequential and Concurrent Deterministic Logic Grammars. 389-395
Yuji Matsumoto:
A Parallel Parsing System for Natural Language Analysis. 396-409

Theory and Higher-Order Functions

Michael J. Maher:
Eqivalences of Logic Programs. 410-424
Phil Vasey:
Qualified Answers and their Application to Transformation. 425-432
M. A. Nait Abdallah:
Procedures in Horn-Clause Programming. 433-447
Dale Miller, Gopalan Nadathur:
Higher-Order Logic Programming. 448-462

Program Analysis

Chris Mellish:
Abstract Interpretation of Prolog Programs. 463-474
Tadashi Kanamori, Hirohisa Seki:
Verification of Prolog Programs Using an Extension of Execution. 475-489
David Scott Warren, Saumya K. Debray:
Detection and Optimization of Functional Computations in Prolog. 490-504
Katsuhiko Nakamura:
Control of Logic Program Execution Based on the Functional Relations. 505-512

Applications and Teaching

Richard Helm, Kim Marriott:
Declarative Graphics. 513-527
Rajiv Gupta:
Test-pattern Generation for VLSI Circuits in a Prolog Environment. 528-535
Christopher J. Rawlings, W. R. Taylor, J. Nyakairu, John Fox, Michael J. E. Sternberg:
Using Prolog to Represent and Reason about Protein Structure. 536-543
Oded Maler, Zahava Scherz, Ehud Y. Shapiro:
A New Approach for Intruducing Prolog to Naive Users. 544-551

Invited Talks

Takashi Chikayama:
Prolog Programming Environments: Architecture and Implementation. 552-553
Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder:
Design Overview of the NAIL! System. 554-568

Implementations and Databases

Kotagiri Ramamohanarao, John Shepherd:
A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases. 569-576
David S. Moffat, Peter M. D. Gray:
Interfacing Prolog to a Persistent Data Store. 577-584
Patrice Boizumault:
A General Model to Implement DIF and FREEZE. 585-592
Martin Nilsson, Hidehiko Tanaka:
Cyclic Tree Traversal. 593-599

Theory and Negation

Roberto Barbuti, Maurizio Martelli:
Completeness of the SLDNF-resolution for a class of logic programs. 600-614
Paul J. Voda:
Choices in, and Limitations of, Logic Programming. 615-623
Lee Naish:
Negation and Quantifiers in NU-Prolog. 624-634
David Poole, Randy Goebel:
Gracefully adding negation and disjunction to Prolog. 635-641

Compilation

Evan Tick:
Memory Performance of Lisp and Prolog Programs. 642-649
Kenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew K. Turk:
The Design and Implementation of a High-Speed Incremental Portable Prolog Compiler. 650-656
Andrew K. Turk:
Compiler Optimizations for the WAM. 657-662
Kevin A. Buettner:
Fast Decompilation of Compiled Prolog Clauses. 663-670

Models of Computation and Implementation

Christopher T. Haynes:
Logic Continuations. 671-685
Chris Moss:
Cut and Paste - defining the impure Primitives of Prolog. 686-694
Masahiro Fujita, Shinji Kono, Hidehiko Tanaka, Tohru Moto-Oka:
Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to Prolog. 695-709
Chengzheng Sun, Tzu Yungui:
The OR-Forest Description for the Execution of Logic Programs. 710-717

Last update Sun May 19 22:37:51 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page