Table of Contents

• Prolog with Communicating Processes: From T-Prolog to CSR-PrologIvan Futó. 3-17
• Hybrid Systems and Constraint Logic ProgrammingAnil Nerode, Wolf Kohn. 18-24
• Continuations in Lambda-PrologPascal Brisset, Olivier Ridoux. 27-43
• Memory Management in Quintus PrologJim A. Crammond, Tim Lindholm. 35-42
• How Concurrent Logic Programming Could Benefit from Using Linda-like OperationsGrzegorz Czajkowski, Krzysztof Zielinski. 43-64
• Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic LogicL. Thorne McCarty. 44-63
• Implementing Logic Programming Systems: The Quiche-Eating ApproachSaumya K. Debray. 65-75
• Call Forwarding: A Simple Low-Level Code Optimization TechniqueSaumya K. Debray, Koenraad De Bosschere, David Gudeman. 77-88
• Analysis of Nonlinear Constraints in CLP(R)Michael Hanus. 83-99
• Moving Prolog Toward ObjectsEnrico Denti, Antonio Natali, Andrea Omicini. 89-101
• Freeness Analysis in the Presence of Numerical ConstraintsVeroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish. 100-115
• MProlog: an Implementation OverviewZsuzsa Farkas, Péter Köves, Péter Szeredi. 103-117
• Freeness Analysis for Logic Programs - And Correctness?Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe. 116-131
• Scheduling Speculative Work in Or-Parallel Prolog SystemsTony Beaumont, David H. D. Warren. 135-149
• A Framework for Sharing AnalysisAndy King. 137-149
• Performance of the Compiler-Based Andorra-I SystemRong Yang, Tony Beaumont, Inês de Castro Dutra, Vítor Santos Costa, David H. D. Warren. 150-166
• Implementing Dynamic Dependent And-ParallelismKish Shen. 167-183
• To Trim or Not to Trim?Jacques Noyé. 167-183
• Some Paradigms for Visualizing Parallel Execution of Logic ProgramsManuel Carro, Luis Manuel Gómez Henríquez, Manuel V. Hermenegildo. 184-200
• Divided We Stand: Parallel Distributed Stack Memory ManagementKish Shen, Manuel V. Hermenegildo. 185-201
• Or-Parallel Prolog on Distributed Shared-Memory ArchitecturesFernando M. A. Silva. 203-215
• Temporal Reasoning in Logic Programming: A Case for the Situation CalculusJavier Pinto, Raymond Reiter. 203-221
• Implementing Sets with Hash Tabels in Declarative LanguagesGiancarlo Succi, Giuseppe Marino, Cristina Dondina, Angelo Bergamini. 217-237
• Representing Actions in Logic Programming and Its Applications in Database UpdatesPhan Minh Dung. 222-238
• Concurrent Logic Programs ::::a la Mode::::Evan Tick, Barton C. Massey, Ferenc Rakoczi, Putthi Tulayathun. 239-254
• Temporal Logic Programming with Bounded Universal Modality GoalsChristoph Brzoska. 239-256
• Reform Prolog: The Language and Its ImplementationJohan Bevemyr, Thomas Lindgren, Håkan Millroth. 283-298
• Multi-Prolog: Definition, Operational Semantics and ImplementationKoenraad De Bosschere, Jean-Marie Jacquet. 299-313
• MultiLog: Data Or-Parallel Logic ProgrammingDonald A. Smith. 314-331
• Transforming Abductive Logic Programs to Disjunctive ProgramsKatsumi Inoue, Chiaki Sakama. 335-353
• A Formalization of Metaprogramming for realGiorgio Levi, Davide Ramundo. 354-373
• A New Fixpoint Semantics for PrologAnnalisa Bossi, Michele Bugliesi, Massimo Fabris. 374-389
• On Copy Avoidance in Single Assignment LanguagesSaumya K. Debray. 393-407
• Findall without findall/3André Mariën. 408-423
• Extracting Determinacy in Logic ProgramsSteven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, R. C. Sekar. 424-438
• Middle-Out Reasoning for Logic Program SynthesisIna Kraan, David A. Basin, Alan Bundy. 441-455
• An Incompleteness Result for Deductive Synthesis of Logic ProgramsKung-Kiu Lau, Mario Ornaghi. 456-477
• Variable Elimination for Generalized Linear ConstraintsJean-Louis Imbert. 499-516
• Boolean Pseudo-equations in Constraint Logic ProgrammingFrédéric Benhamou, Jean-Luc Massat. 517-531
• Solving Linear Diophantine Constraints IncrementallyEvelyne Contejean. 532-549
• A CLP Language Handling Disjunctions of Linear ConstraintsBruno De Backer, Henri Beringer. 550-563
• A Monotonicity Theorem for Extended Logic ProgramsHudson Turner. 567-585
• A Semantics for Eshghi and Kowalski s ProcedureLaura Giordano, Alberto Martelli, Maria Luisa Sapino. 586-600
• Optative Reasoning with Scenario SemanticsLuís Moniz Pereira, José Júlio Alferes. 601-615
• An Argumentation Semantics for Logic Programming with Explicit NegationPhan Minh Dung. 616-630
• Memory Management of Constraint in FlangAndrei Mantsivoda, Vyacheslav Petukhin, Alexei Weimann. 633-646
• Automatic Frequency Assignment for Cellular Telephones Using Constraint Satisfaction TechniquesMats Carlsson, Mats Grindal. 647-665
• Constraint Propagation for Linear Recursive RulesJames Harland, Kotagiri Ramamohanarao. 683-699
• Negation in Disjunctive Logic ProgramsChiaki Sakama, Katsumi Inoue. 703-719
• Proving Termination of GHC ProgramsM. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar. 720-736
• A Logic Programming View of CLPMichael J. Maher. 737-753
• Performance Evaluation of Monaco Compiler and Runtime KernelEvan Tick, C. Banerjee. 757-773
• A Minimal Extension of the WAM for clp(FD)Daniel Diaz, Philippe Codognet. 774-790
• The Underlying Search for Magic Templates and TabulationRoland N. Bol, Lars Degerstedt. 793-811
• Semantics and Consistency of Empirical DatabasesRaymond T. Ng. 812-826
• The SQL Interface of MPrologKalman Balogh. 829-830
• Full Prolog in a NutshellEgon Börger, Dean Rosenzweig. 832
• A Portable and Reasonably Efficient Implementation of KL1Takashi Chikayama, Tetsuro Fujise, Hiroshi Yashiro. 833
• Safety Analysis by Means of Fault Trees: An Application for Open Boolean SolversMarc-Michel Corsini, Antoine Rauzy. 834
• ZEXPERT - A Prolog-Based Shell for Knowledge Base DevelopmentZsuzsa Farkas, Gábor Gerlei, Katalin Molnár, Gábor Umann. 835-836
• User-Defined Constraint HandlingThom W. Frühwirth. 837-838
• A Prolog Toolkit for control System ModelsP. W. Grant, C. P. Jobling. 839-840
• Integration of Traditional Scheduling Techniques and AI on Prolog BasisOleg Yu. Gusikhin. 841
• Optimum Flight Planning System for Aerodrome ZoneS. Ivanets, N. Ilinsky, M. Krylov, S. Timohin. 842
• Function-Patterns and Fan-Backtracking for Logic ProgrammingNikolai K. Kossovsky, Igor P. Solovjev. 843
• Towards Generalized Visualization Support for Logic ProgrammingAnthony J. Kusalik, Gregory M. Oster. 844
• Contribution of Logic Programming to Support Telecommunications Protocol TestsDidier Ladret, Michel Rueher. 845-846
• APPLAUSE: Applications Using the ElipSys Parallel CLP SystemLiang-Liang Li, Mike Reeve, Kees Schuerman, André Véron, Jacques Bellone, Claudine Pradelles, Zissis Palaskas, Takis Stamatopoulos, Dominic A. Clark, Sylvie Doursenot, Christopher J. Rawlings, Jack Shirazi, Giuseppe Sardu. 847-848
• A Logic Programming Approach to Requirements Modelling and Automated Test GenerationLeon J. Mekly, Marjorie Passini Yuhas. 849
• Status of the Aditi Deductive Database SystemJayen Vaghani, Kotagiri Ramamohanarao, David B. Kemp, Zoltan Somogyi, Peter J. Stuckey, Tim S. Leask, James Harland. 851