1. RCLP 1990: Irkutsk, Russia
2. RCLP 1991: St. Petersburg, Russia

• Yves Bekkers, Lucien Ungaro:
  Real-Time Memory Management for Prolog. 1-12
  
• Mounira Belmesk:
  A Process Semantics of Logic Programs. 13-26
  
• Egon Börger, Elvinia Riccobene:
  Logical Operational Semantics of Parlog. Part II: Or-Parallelism. 27-34
  
• Egon Börger, Dean Rosenzweig:
  WAM Algebras - A Mathematical Study of Implementation, Part 2. 35-54
  
• A. G. Bondarenko:
  Abductive Systems for Non-Monotonic Reasoning. 55-65
  
• Vladimir B. Borshchev:
  Properties of Algorithmic Operators. 66-78
  
• Dmitri Yu. Boulanger:
  Deep Logic Program Transformation Using Abstract Interpretation. 79-101
  
• Antonio Brogi, Evelina Lamma, Paola Mello:
  Objects in a Logic Programming Framework. 102-113
  
• François Bry, Rainer Manthey, Bern Martens:
  Integrity Verification in Knowledge Bases. 114-139
  
• Stefania Costantini, Gaetano Aurelio Lanzarone:
  On Procedural Semantics of Metalevel Negation. 140-151
  
• Evgeny Dantsin:
  Probabilistic Logic Programs and their Semantics. 152-164
  
• Bart Demoen, André Mariën:
  Implementation of Prolog as Binary Definite Programs. 165-176
  
• Alexander Ja. Dikovsky:
  Prolog Semantics for Measuring Space Consumption. 177-192
  
• Wai-Keong Foong:
  Or-Parallel Prolog with Heuristic Task Distribution. 193-200
  
• Hans-Günther Hein, Manfred Meyer:
  A WAM Compilation Scheme. 201-214
  
• Martin C. Henson:
  Safe Positive Induction in the Programming Logic TK. 215-231
  
• S. Ivanets, N. Ilinsky, M. Krylov:
  WAM Specification for Parallel Execution on SIMD Computer. 232-239
  
• Gerda Janssens, Maurice Bruynooghe:
  On Abstracting the Procedural Behaviour of Logic Programs. 240-262
  
• Norbert Kehrer, Gustaf Neumann:
  Treating Enhanced Entity Relationship Models in a Declarative Style. 263-270
  
• Evgeny L. Kitaev:
  Processing of Ground Regular Terms in PROLOG. 271-285
  
• Andrei Mantsivoda, Vyacheslav Petukhin:
  Compiling Flang. 286-293
  
• Manfred Meyer, Hans-Günther Hein, Jörg P. Müller:
  FIDO: Finite Domain Consistency Techniques in Logic Programming. 294-301
  
• Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
  A Constructive Logic Approach to Database Theory. 302-321
  
• Dale Miller:
  Abstract Syntax and Logic Programming. 322-337
  
• Vladimir S. Neiman:
  Deduction with Generalized Terms. 338-348
  
• Gustaf Neumann:
  A Simple Transformation from Prolog-written Metalevel Interpreters into Compilers and its Implementation. 349-360
  
• Michel Parigot:
  Free Deduction: An Analysis of "Computations" in Classical Logic. 361-380
  
• Aida Pliuskeviciene:
  Gentzen-Type Calculi for Modal Logic S4 with Barcan Formula. 381-390
  
• Regimantas Pliuskevicius:
  Logical Foundation for Logic Programming Based on First Order Linear Temporal Logic. 391-406
  
• David M. W. Powers:
  Logic Programming with Pseudo-Resolution. 407-414
  
• T. J. Reynolds, Petros Kefalas:
  BRAVE: An OR-Parallel Dialect of Prolog and its Application to Artificial Intelligence. 415-432
  
• Francesco Russo, Mirko Sancassani:
  A Declarative Debugging Environment for DATALOG. 433-441
  
• Jurate Sakalauskaite:
  A Sequent Calculus for a First Order Linear Temporal Logic with Explicit Time. 442-451
  
• P. Sébillot:
  A Logical-Based Language for Feature Specification and Transmission Control. 452-461
  
• Paul Tarau:
  Program Transformations and WAM-Support for the Compilation of Definite Metaprograms. 462-473
  
• Wiebe van der Hoek:
  Some Considerations on the Logic PfD. 474-485
  
• Andrei Voronkov:
  Logic Programming with Bounded Quantifiers. 486-514