Logic Programming: Operational Semantics and Proof Theory

✍ Scribed by James H. Andrews

Publisher: Cambridge University Press
Year: 1992
Tongue: English
Leaves: 120
Series: Distinguished Dissertations in Computer Science
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in which 'depth-first' search for solutions to a logical formula - the usual strategy in most practical languages - is incomplete. Languages that perform 'breadth-first' searches reflect more closely the theory underlying logic programming languages. Researchers interested in logic programming or semantics, as well as artificial intelligence search strategies, will want to consult this book as the only source for some essential and new ideas in the area

✦ Table of Contents

Content: 1. Introduction
2. Operational semantics
3. Characterizing parallel systems
4. Characterizing sequential systems
5. Approaches to incompleteness
6. Summary and future directions
Examples
Index of definitions
Index.

✦ Subjects

Automatic theorem proving;Logic programming;Programming languages (Electronic computers) -- Semantics

📜 SIMILAR VOLUMES

Logic Programming: Operational Semantics

📁 Logic Programming: Operational Semantics and Proof Theory

✍ James H. Andrews 📂 Library 📅 1993 🏛 Cambridge University Press 🌐 English

Logic Programming: Operational Semantics

📁 Logic Programming: Operational Semantics and Proof Theory (Distinguished Dissertations in Computer Science)

✍ James H. Andrews 📂 Library 🌐 English

Reductive Logic and Proof-Search: Proof

📁 Reductive Logic and Proof-Search: Proof Theory, Semantics, and Control

✍ David J. Pym, Eike Ritter 📂 Library 📅 2004 🏛 Oxford University Press, USA 🌐 English

Drawing somewhat on the techniques and culture of philosophy, but mostly on those of mathematics and computing, Pyn (U. of Bath) and Ritter (U. of Birmingham) introduce reductive logic and proof-search. They argue that the reductive view of logic is at least as fundamental as the deductive view; ide

Reductive logic and proof-search: Proof

📁 Reductive logic and proof-search: Proof theory, semantics, and control

✍ David J. Pym, Eike Ritter 📂 Library 📅 2004 🏛 Clarendon Press 🌐 English

This book is a specialized monograph on the development of the mathematical and computational metatheory of reductive logic and proof-search including proof-theoretic, semantic/model-theoretic and algorithmic aspects. The scope ranges from the conceptual background to reductive logic, through its m

Computability Theory, Semantics, and Log

📁 Computability Theory, Semantics, and Logic Programming

✍ Melvin Fitting 📂 Library 📅 1987 🏛 Oxford University Press 🌐 English

This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great int

Computability theory, semantics, and log

📁 Computability theory, semantics, and logic programming

✍ Fitting, Melvin 📂 Library 📅 1987 🏛 Clarendon Press, Oxford University Press 🌐 English