Skip to main content
SpringerLink
Log in

Foundations of Logic Programming

  • Book
  • © 1987

Overview

Authors:
  1. John Wylie Lloyd

    1. Department of Computer Science, University of Melbourne, Parkville, Australia

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Symbolic Computation (SYMBOLIC)

Part of the book sub series: Artificial Intelligence (1064)

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

Access this book

Log in via an institution
eBook USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 129.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 (6 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Preliminaries

    • John Wylie Lloyd
    Pages 1-33

  3. Definite Programs

    • John Wylie Lloyd
    Pages 35-69

  4. Normal Programs

    • John Wylie Lloyd
    Pages 71-106

  5. Programs

    • John Wylie Lloyd
    Pages 107-140

  6. Deductive Databases

    • John Wylie Lloyd
    Pages 141-171

  7. Perpetual Processes

    • John Wylie Lloyd
    Pages 173-193

  8. Back Matter

    Pages 195-212
    Download chapter PDF
Back to top

Keywords

About this book

In the two and a half years since the frrst edition of this book was published, the field of logic programming has grown rapidly. Consequently, it seemed advisable to try to expand the subject matter covered in the first edition. The new material in the second edition has a strong database flavour, which reflects my own research interests over the last three years. However, despite the fact that the second edition has about 70% more material than the first edition, many worthwhile topic!! are still missing. I can only plead that the field is now too big to expect one author to cover everything. In the second edition, I discuss a larger class of programs than that discussed in the first edition. Related to this, I have also taken the opportunity to try to improve some of the earlier terminology. Firstly, I introduce "program statements", which are formulas of the form A+-W, where the head A is an atom and the body W is an arbitrary formula. A "program" is a finite set of program statements. There are various restrictions of this class. "Normal" programs are ones where the body of each program statement is a conjunction of literals. (The terminology "general", used in the first edition, is obviously now inappropriate).

Authors and Affiliations

  • Department of Computer Science, University of Melbourne, Parkville, Australia

    John Wylie Lloyd

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation