Table of Contents

• Visualization and Interaction in Logic ProgrammingJosé Paulo Leal.
• A Type Based Debugging Tool for Untyped Logic LanguagesUlrich Geske, Mario Lenz.
• Automatic Generation of Graphical Interfaces in an Object-Logic Programming EnvironmentBernardo Lula Jr., Eugène Chouraqui, Hélio de Menezes Silva.
• LOGOS: An Object-Oriented Scheme to Implement Logic Programming LanguagesLiviu-Virgil Ciortuz, Mirela Petrea.
• A Proof Manager for Verification of Logic ProgramsSophie Renault, Pierre Deransart.
• F-Logic Programming and Terminological ConstraintsChristophe Rigotti, Mohand-Said Hacid, Jean-François Boulicaut. 1-11 [doi]
• Design and Implementation of a Declarative Data-Parallel LanguageOlivier Michel, Jean-Louis Giavitto. 1-10 [doi]
• Process-Based Parallel Logic Programming: A Survey of the Basic IssuesKoenraad De Bosschere. 1-10 [doi]
• Lazy Funtional State Threads: An AbstractJohn Launchbury, Simon L. Peyton Jones. 3-5
• Implementation of Andorra-based LanguagesSverker Janson. 9-10
• Parallel Symbolic Computing with the Shared Dataspace Coordination ModelPaolo Ciancarini, Mauro Gaspari. 11-37 [doi]
• Towards a Formal Computation Model of Associative Logic ProgrammingArvind K. Bansal. 11-20 [doi]
• A Tutorial on Synthesis of Logic Programs from SpecificationsKung-Kiu Lau, Geraint A. Wiggins. 11-14
• A Layer Architecture for the Integration of Rules, Inheritance, and ConstraintsAndreas Abecker, Holger Wache. 12-22 [doi]
• Modularity in Logic ProgrammingEvelina Lamma, Paola Mello. 15-17
• Abduction and Abductive Logic ProgrammingAntonis C. Kakas, Paolo Mancarella. 18-19
• Modelling the Connection Machine 2 as an Emulator of Subset-Based Declarative LanguagesGiancarlo Succi, Giuseppe Marino, Giancarlo Colla. 21-32 [doi]
• Splitting a Logic ProgramVladimir Lifschitz, Hudson Turner. 23-37
• Semantics of Constraint Logic Programs with OptimizationKim Marriott, Peter J. Stuckey. 23-35 [doi]
• Modeling Backtracking, Disjunctive Constraints, and Control/Data Or-ParallelismDonald A. Smith. 33-47 [doi]
• Logic Programming with Constructor-based Type ConstraintsHans-Joachim Goltz. 36-45 [doi]
• Towards Resource Handling in Logic Programming: the PPL Framework and its SemanticsJean-Marie Jacquet, Luís Monteiro. 38-53 [doi]
• Language Independence and Language Tolerance in Logic ProgramsNorman McCain, Hudson Turner. 38-57
• A Note on Data-Parallelism and (And-Parallel) PrologManuel V. Hermenegildo, Manuel Carro. 49-64 [doi]
• Design of a Resolution Multiprocessor for the Parallel Virtual MachineHamish Taylor. 54-63 [doi]
• Computing Stable Models by Program TransformationJürgen Stuber. 58-73
• The JUMP-machine: A Generic Basis for the Integration of Declarative ParadigmsManuel M. T. Chakravarty, Hendrik C. R. Lock. 61-75 [doi]
• A Proposal to Merge Object Orientation, Logic Programming, and Multiple Tuple SpacesVincenzo Ambriola, Giovanni A. Cignoni, Laura Semini. 64-69 [doi]
• &ACE: the And-parallel Component of ACE (A Progress Report on ACE)Enrico Pontelli, Gopal Gupta, Manuel V. Hermenegildo. 65-78 [doi]
• Search Tree Unification: Paradigm for Process-based Logic ProgramsSzabolcs Ferenczi. 70-74 [doi]
• Declarative Interpretations ReconsideredKrzysztof R. Apt, Maurizio Gabbrielli. 74-89
• The Real-Time Extension of CS-Prolog ProfessionalIvan Futó. 75-82 [doi]
• Integrating Disequations in the Algebraic and Logic Programming Language LPGDidier Bert, Rachid Echahed. 76-93 [doi]
• A Comparison of Some Schemes for Translating Logic to CBart Demoen, Greet Maris. 79-91 [doi]
• A Poor Man s Co-ordination of Prolog: COPrDavid Moffat. 83-87 [doi]
• Process Semantics for ResolutionA. Lopes, José Félix Costa, Danilo Montesi. 88
• Last Parallel Call Optimization and Fast Backtracking in And-parallel Logic Programming SystemsTang Dong Xing, Enrico Pontelli, Gopal Gupta, Manuel Carro. 93-106 [doi]
• ACE: And/Or-parallel Copying-based Execution of Logic ProgramsGopal Gupta, Manuel V. Hermenegildo, Enrico Pontelli, Vítor Santos Costa. 93-109
• Efficient Integration of Declarative Paradigms into Symbolic Computation SystemsGeorgios Grivas. 94-105 [doi]
• Implementation Issues of a Distributed Real-Time Logic LanguageManuel Díaz, Bartolomé Rubio, José M. Troya. 106-119 [doi]
• IDRA (IDeal Resource Allocation): A Tool for Computing Ideal SpeedupsM. J. Fernández, Manuel Carro, Manuel V. Hermenegildo. 107-122 [doi]
• Hybrid Tree Search in the Andorra ModelRemco Moolenaar, Bart Demoen. 110-123
• Compilation of Concurrent Declarative LanguagesZena M. Ariola, Barton C. Massey, M. Sami, Evan Tick. 120-134 [doi]
• Parallel CLP on Heterogeneous NetworksShyam Mudambi, Joachim Schimpf. 124-141
• Distributed Declarative Systems as Parts of Cooperating Software EnvironmentsGrzegorz Czajkowski, Andrzej Uszok, Krzysztof Zielinski. 135 [doi]
• PDP: Prolog Distributed Processor for Independent AND/OR Parallel Execution of PrologLourdes Araujo, José J. Ruz. 142-156
• On the Scheme of Passing Arguments in Stack Frames for PrologNeng-Fa Zhou. 159-174
• Output Value Placement in Moded Logic ProgramsPeter A. Bigot, David Gudeman, Saumya K. Debray. 175-189
• Native Code Compilation in SICStus PrologRalph Clarke Haygood. 190-204
• Representing Actions in Equational Logic ProgrammingMichael Thielscher. 207-224
• Representing Continuous Change in the Abductive Event CalculusKristof Van Belleghem, Marc Denecker, Danny De Schreye. 225-239
• Concurrency and Plan Generation in a Logic Programming Language with a Sequential OperatorAlessio Guglielmi. 240-254
• Computing Annotated Logic ProgramsSonia M. Leach, James J. Lu. 257-271
• Conditonal Logic ProgrammingDov M. Gabbay, Laura Giordano, Alberto Martelli, Nicola Olivetti. 272-289
• Causal Models of Disjunctive Logic ProgramsJürgen Dix, Georg Gottlob, V. Wiktor Marek. 290-302
• An Axiomatic Approach to Semantics of Disjunctive ProgramsJürgen Dix, Martin Müller. 303-320
• Finding Conflict Sets and Backtrack Points in CLP(R)Jennifer Burg, Sheau-Dong Lang, Charles E. Hughes. 323-338
• Entailment of Finite Domain ConstraintsBjörn Carlson, Mats Carlsson, Daniel Diaz. 339-353
• Notes on the Design of an Open Boolean SolverAntoine Rauzy. 354-368
• Improved CLP Scheduling with Task IntervalsYves Caseau, François Laburthe. 369-383
• Ambivalent Logic as the Semantic Basis of Metalogic ProgrammingYuejun Jiang. 387-401
• Higher-order Aspects of Logic ProgrammingUday S. Reddy. 402-418
• Higher-Order Polymorphic Unification for Logic ProgrammingLuís Caires, Luís Monteiro. 419-433
• A Database Interface for Complex ObjectsMarcel Holsheimer, Rolf A. de By, Hassan Aït-Kaci. 437-455
• A Slick Procedure for Integrity Checking in Deductive DatabasesHendrik Decker, Matilde Celma. 456-469
• LPDA: Another look at Tabulation in Logic ProgrammingEric Villemonte de la Clergerie, Bernard Lang. 470-486
• On the Equivalence between Disjunctive and Abductive Logic ProgramsChiaki Sakama, Katsumi Inoue. 489-503
• The Acceptability Semantics for Logic ProgramsAntonis C. Kakas, Paolo Mancarella, Phan Minh Dung. 504-519
• A Bottom-up Semantics for Constructive NegationAnnalisa Bossi, Massimo Fabris, Maria Chiara Meo. 520-534
• Default Rules: An Extension of Constructive Negation for Narrowing-based LanguagesJuan José Moreno-Navarro. 535-549
• Depth-k Sharing and FreenessAndy King, Paul Soper. 553-568
• Towards a Practical Full Mode Inference System for CLP(H, N)Veroniek Dumortier, Gerda Janssens. 569-583
• Fast and Precise Regular Approximations of Logic ProgramsJohn P. Gallagher, D. Andre de Waal. 599-613
• Constraint Solving by Narrowing in Combined Algebraic DomainsHélène Kirchner, Christophe Ringeissen. 617-631
• Compiling Intensional Sets in CLPPaola Bruscoli, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi. 647-661
• The Halting Problem for Deductive Synthesis of Logic ProgramsKung-Kiu Lau, Mario Ornaghi, Sten-Åke Tärnlund. 665-683
• A New Transformation based on Process-Message Duality for Concurrent Logic LanguagesKouichi Kumon, Keiji Hirata. 684-698
• Compiling Control Revisited: A New Approach based upon Abstract InterpretationDmitri Boulanger, Danny De Schreye. 699-713
• Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical VariablesMaurizio Proietti, Alberto Pettorossi. 714-729
• Conjunto: Constraint Propagation over Set Constraints with Finite Set Domain VariablesCarmen Gervet. 733
• Logic Programs with Refutation RulesMarion Mircheva. 734
• Efficient and Complete Demo Predicates for Definite Clause LanguagesHenning Christiansen. 735-736
• Recomputation-Free Lemmatization by Program TransformationPaulo Jorge de Sousa Azevedo, Marek J. Sergot. 739-740
• IsaWhelk Interpreted in IsabelleDavid A. Basin. 741
• Reflection through Constraint SatisfactionJonas Barklund, Pierangelo Dell Acqua, Stefania Costantini, Gaetano Aurelio Lanzarone. 742
• PP-clauses: A Means for Handling ResourcesJean-Marie Jacquet, Luís Monteiro. 743
• Proving Hardware DesignsPeter T. Breuer, Luis Sánchez, Carlos Delgado Kloos. 745
• A Dataflow Analysis Method for Ground PrologAndreas Kågedal. 746
• Logic Programming as Quantum MeasurementRoman R. Zapatrin. 747