Abstract is missing.
- The Role of Logic Programming in the Fifth Generation Computer ProjectKazuhiro Fuchi, Koichi Furukawa. 1-24
- An Abstract Machine for Restricted AND-Parallel Execution of Logic ProgramsManuel V. Hermenegildo. 25-39
- Efficient Management of Backtracking in AND-ParallelismManuel V. Hermenegildo, R. I. Nasr. 40-54
- An Intelligent Backtracking Algorithm for Parallel Execution of Logic ProgramsYow-Jian Lin, Vipin Kumar, Clement H. C. Leung. 55-68
- Delta Prolog: A Distributed Backtracking Extension with EventsLuís Moniz Pereira, Luís Monteiro, José C. Cunha, Joaquim Nunes Aparício. 69-83
- OLD Resolution with TabulationHisao Tamaki, Taisuke Sato. 84-98
- Logic Programs and AlternationPetr Stepánek, Olga Stepánková. 99-106
- Intractable Unifiability Problems and BacktrackingDavid A. Wolfram. 107-121
- On the Complexity of Unification SequencesHeikki Mannila, Esko Ukkonen. 122-133
- How to Invent a Prolog MachinePeter Kursawe. 134-148
- A Sequential Implementation of ParlogIan T. Foster, Steve Gregory, Graem A. Ringwood, Ken Satoh. 149-156
- A GHC Abstract Machine and Instruction SetJacob Levy. 157-171
- A Prolog Processor Based on a Pattern Matching Memory DeviceIan Robinson. 172-179
- An Improvised Version of Shapiro s Model Inference SystemMatthew M. Huntbach. 180-187
- A Framework for ICAI Systems Based on Inductive Inference and Logic ProgrammingKazuhisa Kawai, Riichiro Mizoguchi, Osamu Kakusho, Jun ichi Toyoda. 188-202
- Rational Debugging in Logic ProgrammingLuís Moniz Pereira. 203-210
- Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic ReasoningRandy Goebel, Koichi Furukawa, David Poole. 211-222
- Invited Talk: Some Issues and Trends in the Semantics of Logic ProgrammingJoxan Jaffar, Jean-Louis Lassez, Michael J. Maher. 223-241
- Parallel Logic Programming LanguagesAkikazu Takeuchi, Koichi Furukawa. 242-254
- P-Prolog: A Parallel Logic Language Based on Exclusive RelationRong Yang, Hideo Aiso. 255-269
- Making Exhaustive Search Programs DeterministicKazunori Ueda. 270-282
- Compiling OR-parallelism into AND-parallelismMichael Codish, Ehud Y. Shapiro. 283-297
- Shared Memory Execution of Committed-choice LanguagesJacob Levy. 298-312
- Logic Program Semantics for Programming with EquationsJoxan Jaffar, Peter J. Stuckey. 313-326
- On the Semantics of Logic Programing LanguagesAlberto Martelli, Gianfranco Rossi. 327-334
- Towards a Formal Semantics for Concurrent Logic Programming LanguagesLennart Beckman. 335-349
- Design of a Prolog-Based Machine Translation SystemMichael C. McCord. 350-374
- Parallel Logic Programming for Numeric ApplicationsRalph Butler, Ewing L. Lusk, William McCune, Ross A. Overbeek. 375-388
- Sequential and Concurrent Deterministic Logic GrammarsHarvey Abramson. 389-395
- A Parallel Parsing System for Natural Language AnalysisYuji Matsumoto. 396-409
- Eqivalences of Logic ProgramsMichael J. Maher. 410-424
- Qualified Answers and their Application to TransformationPhil Vasey. 425-432
- Procedures in Horn-Clause ProgrammingM. A. Nait Abdallah. 433-447
- Higher-Order Logic ProgrammingDale Miller, Gopalan Nadathur. 448-462
- Abstract Interpretation of Prolog ProgramsChris Mellish. 463-474
- Verification of Prolog Programs Using an Extension of ExecutionTadashi Kanamori, Hirohisa Seki. 475-489
- Detection and Optimization of Functional Computations in PrologDavid Scott Warren, Saumya K. Debray. 490-504
- Control of Logic Program Execution Based on the Functional RelationsKatsuhiko Nakamura. 505-512
- Declarative GraphicsRichard Helm, Kim Marriott. 513-527
- Test-pattern Generation for VLSI Circuits in a Prolog EnvironmentRajiv Gupta. 528-535
- Using Prolog to Represent and Reason about Protein StructureChristopher J. Rawlings, W. R. Taylor, J. Nyakairu, John Fox, Michael J. E. Sternberg. 536-543
- A New Approach for Intruducing Prolog to Naive UsersOded Maler, Zahava Scherz, Ehud Y. Shapiro. 544-551
- Prolog Programming Environments: Architecture and ImplementationTakashi Chikayama. 552-553
- Design Overview of the NAIL! SystemKatherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder. 554-568
- A Superimposed Codeword Indexing Scheme for Very Large Prolog DatabasesKotagiri Ramamohanarao, John Shepherd. 569-576
- Interfacing Prolog to a Persistent Data StoreDavid S. Moffat, Peter M. D. Gray. 577-584
- A General Model to Implement DIF and FREEZEPatrice Boizumault. 585-592
- Cyclic Tree TraversalMartin Nilsson, Hidehiko Tanaka. 593-599
- Completeness of the SLDNF-resolution for a class of logic programsRoberto Barbuti, Maurizio Martelli. 600-614
- Choices in, and Limitations of, Logic ProgrammingPaul J. Voda. 615-623
- Negation and Quantifiers in NU-PrologLee Naish. 624-634
- Gracefully adding negation and disjunction to PrologDavid Poole, Randy Goebel. 635-641
- Memory Performance of Lisp and Prolog ProgramsEvan Tick. 642-649
- The Design and Implementation of a High-Speed Incremental Portable Prolog CompilerKenneth A. Bowen, Kevin A. Buettner, Ilyas Cicekli, Andrew K. Turk. 650-656
- Compiler Optimizations for the WAMAndrew K. Turk. 657-662
- Fast Decompilation of Compiled Prolog ClausesKevin A. Buettner. 663-670
- Logic ContinuationsChristopher T. Haynes. 671-685
- Cut and Paste - defining the impure Primitives of PrologChris Moss. 686-694
- Tokio: Logic Programming Language Based on Temporal Logic and its Compilation to PrologMasahiro Fujita, Shinji Kono, Hidehiko Tanaka, Tohru Moto-Oka. 695-709
- The OR-Forest Description for the Execution of Logic ProgramsChengzheng Sun, Tzu Yungui. 710-717