Foundations of disjunctive logic programming
Jorge Lobo, Jack Minker, Arcot Rajasekar · Medical Entomology and Zoology · 1992
Part 1 Introduction and background: motivation historical background. Part 2 Definitions and terminology: first-order theory - syntax first order theory - semantics logic programs - syntax logic programs - semantics - models and interpretations substitutions and unifiers fixpoint theory. Part 3 Declarative semantics: logical consequences model theory fixpoint theory comparison of definite and disjunctive logic programs. Part 4 Proof theory: query type and correct answers SLI resolution and SLD resolution soundness of SLI resolution completeness of SLI resolution computation rule comparison of SLD and SLI resolution. Part 5 Negation: generalized closed world assumption procedural interpretation for the GCWA non-herbrand models and the GCWA constructive answers. Part 6 Weak negation: weak generalized closed world assumption finite failure semantics fixpoint characterization completion theory procedural interpretation. Part 7 Normal logic programs: normal disjunctive logic programs the generalized disjunctive well-founded semantics stationary semantics comparison of semantics normal logic programs. Part 8 Proof theory - normal programs: SLIS resolution soundness of SLIS resolution completeness of SLIS resolution. Part 9 Disjunctive deductive databases: disjunctive deductive databases queries and answers incremental evaluation of hierarchical DDDB's model trees - a data structure for sets of minimal models incremental computation on model trees computing answers on trees meaningless models and denials. Part 10 Applications: view updates combining deductive databases.