Skip to main content
SpringerLink
Log in

Extensions of Logic Programming

4th International Workshop, ELP '93, St Andrews, U.K., March 29 - April 1, 1993. Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Roy Dyckhoff
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: ELP 1993.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (22 papers)

  1. Front Matter

    Download chapter PDF

  2. Introduction

    Pages 1-2

  3. Design for AKL with intelligent pruning

    • Salvador Abreu, Luís Moniz Pereira
    Pages 3-10

  4. Contradiction: When avoidance equals removal Part I

    • José Júlio Alferes, Luís Moniz Pereira
    Pages 11-23

  5. Birkhoff's HSP-theorem for cumulative logic programs

    • Beatrice Amrhein
    Pages 24-36

  6. Finite domains and exclusions as first-class citizens

    • Harold Boley
    Pages 37-61

  7. Some experimental results in implementing a logic language with multi-head clauses on a Transputer architecture

    • Anna Ciampolini, Evelina Lamma, Paola Mello, Cesare Stefanelli
    Pages 62-76

  8. A language with finite sets embedded in the CLP-scheme

    • Agostino Dovier
    Pages 77-93

  9. Finitary partial inductive definitions as a general logic

    • Lars -Henrik Eriksson
    Pages 94-119

  10. Programming methodologies in GCLA

    • Göran Falkman, Olof Torgersson
    Pages 120-151

  11. Computing cost estimates for proof strategies

    • Knut Hinkelmann, Helge Hintze
    Pages 152-170

  12. Logic programming with multiple context management schemes

    • Joshua S. Hodas
    Pages 171-182

  13. Non-procedural logic programming

    • Seppo Keronen
    Pages 183-195

  14. Axioms in definitional calculi

    • Per Kreuger
    Pages 196-205

  15. A proposal for modules in λProlog

    • Dale Miller
    Pages 206-221

  16. Regular search spaces as a foundation of logic programming

    • Alberto Momigliano, Mario Ornaghi
    Pages 222-254

  17. Answer sets and nonmonotonic S4

    • David Pearce, Gruppe LWI
    Pages 255-267

  18. Contradiction: When avoidance equals removal Part II

    • Luís Moniz Pereira, José Júlio Alferes
    Pages 268-281

  19. Cut formulae and logic programming

    • Luis Pinto
    Pages 282-300

  20. Higher-order aspects of logic programming

    • Uday S. Reddy
    Pages 301-321
Back to top

Other volumes

  1. Extensions of Logic Programming

Keywords

About this book

The papers in this volume are extended versions of presentations at the fourth International Workshop on Extensions of Logic Programming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logic programming, knowledge representation, contradiction avoidance, disjunctive databases, strong negation, linear logic programming, proof theory and regular search spaces, finite sets and constraint logic programming, search-space pruning and universal algebra, and implementation on transputer networks.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation