Advertisement

Logic Programming

First Russian Conference on Logic Programming Irkutsk, Russia, September 14–18, 1990 Second Russian Conference on Logic Programming St. Petersburg, Russia, September 11–16, 1991 Proceedings

  • Editors
  • A. Voronkov
Conference proceedings

Part of the Lecture Notes in Computer Science book series (LNCS, volume 592)

Table of contents

  1. Front Matter
    PDF
  2. Real-time memory management for Prolog
    Yves Bekkers, Lucien Ungaro
    Pages 1-12
  3. A process semantics of logic programs
    M. Belmesk
    Pages 13-26
  4. Logical operational semantics of Parlog Part II: Or-Parallelism
    Egon Börger, Elvinia Riccobene
    Pages 27-34
  5. WAM algebras—A mathematical study of implementation Part 2
    Egon Börger, Dean Rosenzweig
    Pages 35-54
  6. Abdugtive systems for non-monotonig reasoning
    A. G. Bondarenko
    Pages 55-65
  7. Properties of algorithmic operators
    Vladimir B. Borshchev
    Pages 66-78
  8. Deep logic program transformation using abstract interpretation
    Dmitri Yu. Boulanger
    Pages 79-101
  9. Objects in a logic programming framework
    Antonio Brogi, Evelina Lamma, Paola Mello
    Pages 102-113
  10. Integrity verification in knowledge bases
    François Bry, Rainer Manthey, Bern Martens
    Pages 114-139
  11. On procedural semantics of metalevel negation
    S. Costantini, G. A. Lanzarone
    Pages 140-151
  12. Probabilistic logic programs and their semantics
    Eugene Dantsin
    Pages 152-164
  13. Implementation of Prolog as binary definite programs
    Bart Demoen, André Mariën
    Pages 165-176
  14. Prolog semantics for measuring space consumption
    A. Ja. Dikovsky
    Pages 177-192
  15. Or-parallel Prolog with heuristic task distribution
    Wai -Keong Foong
    Pages 193-200
  16. A WAM compilation scheme
    Hans -Günther Hein, Manfred Meyer
    Pages 201-214
  17. Safe positive induction in the programming logic TK
    Martin C. Henson
    Pages 215-231
  18. Wam specification for parallel execution on SIMD computer
    S. Ivanets, N. Ilinsky, M. Krylov
    Pages 232-239
  19. On abstracting the procedural behaviour of logic programs
    G. Janssens, M. Bruynooghe
    Pages 240-262
  20. Treating enhanced entity relationship models in a declarative style
    Norbert Kehrer, Gustaf Neumann
    Pages 263-270
  21. Processing of ground regular terms in Prolog
    Evgeny L. Kitaev
    Pages 271-285
  22. Compiling Flang
    Andrei Mantsivoda, Vyacheslav Petukhin
    Pages 286-293
  23. FIDO: Finite domain consistency techniques in logic programming
    Manfred Meyer, Hans -Günther Hein, Jörg Müller
    Pages 294-301
  24. A constructive logic approach to database theory
    Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi
    Pages 302-321
  25. Abstract syntax and logic programming
    Dale Miller
    Pages 322-337
  26. Deduction search with generalized terms
    Vladimir S. Neiman
    Pages 338-348
  27. A simple transformation from Prolog-written metalevel interpreters into compilers and its implementation
    Gustaf Neumann
    Pages 349-360
  28. Free deduction: An analysis of “Computations” in classical logic
    Michel Parigot
    Pages 361-380
  29. Gentzen-type calculi for modal logic S4 with barcan formula
    Aida Pliuškevičienė
    Pages 381-390
  30. Logical foundation for logic programming based on first order linear temporal logic
    Regimantas Pliuškevičius
    Pages 391-406
  31. Logic Programming with Pseudo-Resolution
    David M. W. Powers
    Pages 407-414
  32. Brave: An OR-parallel dialect of Prolog and its application to artificial intelligence
    T. J. Reynolds, P. Kefalas
    Pages 415-432
  33. A declarative debugging environment for DATALOG
    Francesco Russo, Mirko Sancassani
    Pages 433-441
  34. A sequent calculus for a first order linear temporal logic with explicit time
    Jūratė Sakalauskaitė
    Pages 442-451
  35. A logical-based language for feature specification and transmission control
    P. Sébillot
    Pages 452-461
  36. Program transformations and WAM-support for the compilation of definite metaprograms
    Paul Tarau
    Pages 462-473
  37. Some considerations on the logic PFD
    Wiebe van der Hoek
    Pages 474-485
  38. Logic programming with bounded quantifiers
    Andrei Voronkov
    Pages 486-514
  39. Back Matter
    PDF

About these proceedings

Introduction

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.

Keywords

Automat Automated Reasoning Deductive Databases Deduktive Datenbanken Logic Programming Nichtklassische Logik (EDV) Non-classiccal Logics PROLOG Programmierung (EDV) Prolog-Programming Theorembeweisen (Kybern.) automated theorem proving logic mathematical logic theorem proving

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-55460-2
  • Copyright Information Springer-Verlag Berlin Heidelberg 1992
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-55460-8
  • Online ISBN 978-3-540-47083-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site