Foundations of disjunctive logic programming
著者
書誌事項
Foundations of disjunctive logic programming
（Logic programming）
MIT Press, c1992
大学図書館所蔵 全26件
注記
Includes bibliographical references and indexes
内容説明・目次
内容説明
This monograph provides an intensive course for graduate students in computer science, as well as others interested in extensions of logic programming, on the theoretical foundations 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.
目次
- 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.
「Nielsen BookData」 より