Real-time memory management for Prolog -- A process semantics of logic programs -- Logical operational semantics of Parlog Part II: Or-Parallelism -- WAM algebras—A mathematical study of implementation Part 2 -- Abdugtive systems for non-monotonig reasoning -- Properties of algorithmic operators -- Deep logic program transformation using abstract interpretation -- Objects in a logic programming framework -- Integrity verification in knowledge bases -- On procedural semantics of metalevel negation -- Probabilistic logic programs and their semantics -- Implementation of Prolog as binary definite programs -- Prolog semantics for measuring space consumption -- Or-parallel Prolog with heuristic task distribution -- A WAM compilation scheme -- Safe positive induction in the programming logic TK -- Wam specification for parallel execution on SIMD computer -- On abstracting the procedural behaviour of logic programs -- Treating enhanced entity relationship models in a declarative style -- Processing of ground regular terms in Prolog -- Compiling Flang -- FIDO: Finite domain consistency techniques in logic programming -- A constructive logic approach to database theory -- Abstract syntax and logic programming -- Deduction search with generalized terms -- A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation -- Free deduction: An analysis of “Computations” in classical logic -- Gentzen-type calculi for modal logic S4 with barcan formula -- Logical foundation for logic programming based on first order linear temporal logic -- Logic Programming with Pseudo-Resolution -- Brave: An OR-parallel dialect of Prolog and its application to artificial intelligence -- A declarative debugging environment for DATALOG -- A sequent calculus for a first order linear temporal logic with explicit time -- A logical-based language for feature specification and transmission control -- Program transformations and WAM-support for the compilation of definite metaprograms -- Some considerations on the logic PFD -- Logic programming with bounded quantifiers.

This volume contains the proceedings of two Russian conferences on logic programming, held in 1990 in Irkutsk and in 1991 in St. Petersburg. The aim of the conferences was to bring together researchers from the Russian and the international logic programming communities. Topics covered in the volume include: logic programming, automated theorem proving, non-monotonic reasoning, applications of mathematical logic to computer science, deductivedatabases, implementation of declarative concepts, and programming in non-classical logics. This is the first volume to represent activity in the field of logic programming in the countries of the former Soviet Union.