🚀 go-pugleaf

The following monograph has just been published by MIT Press.
A  brief abstract  of the monograph  is given below together
with the Table of Contents.

                            Foundations

                                of

                   Disjunctive Logic Programming

                                by

            Jorge Lobo, Jack Minker and Arcot Rajasekar



    This  monograph provides  an intensive course  for graduate
students in  computer science, as well as for others interested
in  extensions  of logic programming, on the theoretical found-
ations of disjunctive logic programming


    Disjunctive  logic programming  permits  the description of
indefinite or incomplete information  through  a disjunction of
atoms  in  the head  of a clause.  The authors  describe  model
theoretic semantics,  proof theoretic semantics,  and  fixpoint
semantics  for disjunctive  and  normal disjunctive programs (a
normal disjunctive program permits negated atoms in the body of
a clause)  and present theories of negation. They conclude with
selected applications to knowledge databases.


    The Table of Contents for the monograph is as follows:

List of Figures

List of Tables

Series Foreword

Preface

1    INTRODUCTION AND BACKGROUND

1.1     Motivation
1.2     Historical background

2    DEFINITIONS AND TERMINOLOGY

2.1     First-order - syntax
2.2     First order theory - semantics
2.3     Logic programs - syntax
2.4     Logic programs - semantics: models and interpretations
2.5     Substitutions and unifiers
2.6     Fixpoint Theory

3    DECLARATIVE SEMANTICS

3.1     Logical consequences
3.2     Model theory
3.3     Fixpoint theory
3.4     Comparison of definite and disjunctive logic programs

4    PROOF THEORY

4.1     Query type and correct answers
4.2     SLI resolution and SLD resolution
4.3     Soundness of SLI resolution
4.4     Completeness of SLI resolution
4.5     Computation rule
4.6     Comparison of SLD and SLI resolution

5    NEGATION

5.1     Generalized closed world assumption
5.2     Procedural interpretation for the GCWA
5.3     Non-Herbrand models and the GCWA
5.4     Constructive answers

6    WEAK NEGATION

6.1     Weak generalized closed world assumption
6.2     Finite failure semantics
6.3     Fixpoint Characterization
6.4     Completion theory
6.5     Procedural interpretation

7    NORMAL LOGIC PROGRAMS

7.1     Normal disjunctive logic programs
7.2     The generalized disjunctive well-founded semantics
7.3     Stationary semantics
7.4     Comparison of semantics
7.5     Normal logic programs

8    PROOF THEORY: NORMAL PROGRAMS

8.1     Introduction
8.2     SLIS resolution
8.3     Soundness of SLIS resolution
8.4     Completeness of SLIS resolution

9    DISJUNCTIVE DEDUCTIVE DATABASES

9.1     Disjunctive deductive databases
9.2     Queries and answers
9.3     Incremental evaluation of hierarchical DDDB's
9.4     Model trees: a data structure for sets of minimal models
9.5     Incremental computation on model trees
9.6     Computing answers on trees
9.7     Meaningless models and denials
9.8     Background

10    APPLICATIONS

10.1     View updates
10.2     Combining deductive databases

Bibliography

Index

Author Index