Deductive database theories
- 1 March 1989
- journal article
- research article
- Published by Cambridge University Press (CUP) in The Knowledge Engineering Review
- Vol. 4 (4) , 267-304
- https://doi.org/10.1017/s0269888900005129
Abstract
This paper surveys a variety of deductive database theories. Such theories differ from one another in the set of axioms and metarules that they allow and use. The following theories are discussed: relational, Horn, and stratified in the text; protected, disjunctive, typed, extended Horn, and normal in the appendix. Connections with programming in terms of the declarative, fixpoint, and procedural semantics are explained. Negation is treated in several different ways: closed world, completed database, and negation as failure. For each theory examples are given and implementation issues are considered.Keywords
This publication has 25 references indexed in Scilit:
- Weak Generalized Closed World AssumptionJournal of Automated Reasoning, 1989
- On the relationship between circumscription and negation as failureArtificial Intelligence, 1989
- Perspectives in deductive databasesThe Journal of Logic Programming, 1988
- Negation as Failure Using Tight Derivations for General Logic ProgramsPublished by Elsevier ,1988
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Negation in Logic ProgrammingPublished by Elsevier ,1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- Saturation, nonmonotonic reasoning and the closed-world assumptionArtificial Intelligence, 1985
- Logic and Databases: A Deductive ApproachACM Computing Surveys, 1984