Abstract:
Abstract. The computational complexity of a number of problems relating to minimal models of deductive databases is considered. In particular, it is shown that Minker's generalised closed world assumption (GCWA) is
Citations
|
131
|
On indefinite databases and the closed world assumption. Lecture
– Minker
|
|
119
|
Logic and databases: a deductive approach
– Gallaire, Minker, et al.
- 1984
|
|
101
|
Propositional circumscription and extended closed-world reasoning are� P�-complete
– Eiter, Gottlob
- 1993
|
|
93
|
On closed world databases
– Reiter
- 1978
|
|
87
|
The complexity of facets (and some facets of complexity
– Papadimitriou, Yannakakis
- 1984
|
|
66
|
Negation in Logic Programming
– Shepherdson
- 1988
|
|
61
|
More complicated questions about maxima and minima, and some closures of NP
– Wagner
- 1987
|
|
45
|
The polynomial time hierarchy
– Stockmeyer
- 1976
|
|
44
|
Deduction in non-horn databases
– Yahia, Henschen
- 1985
|
|
18
|
Answering Queries in Indefinite Databases and the Null Value Problem
– Grant, Minker
- 1986
|
|
12
|
Compiling the GCWA in Indefinite Databases
– Henschen, Park
- 1988
|
|
10
|
Generalized Closed World Assumption is
– Chomicki, Subrahmanian
- 1990
|
|
10
|
On the Semantics of Stratified Deductive Databases
– Przymusinski
- 1986
|
|
8
|
The Theory of Computability
– Sommerhalder, Westrhenen
- 1988
|
|
8
|
Complete sets and the polynomial time hierarchy
– Wrathall
- 1977
|
|
6
|
Deduction trees and the view update problem in indefinite deductive databases
– Johnson
- 1997
|
|
3
|
Coping with indefinite and negative data in deductive databases: A survey, Data Knowledge Engineering 2
– Chisholm, Chen, et al.
- 1987
|
|
3
|
Top-down Deduction in Indefinite Deductive Databases
– Johnson
- 1993
|
|
2
|
Handling indefinite and negative data in a deductive database
– Johnson
- 1991
|
|
2
|
Some extensions to the closed world assumption
– Naqvi
- 1986
|
|
1
|
Query answering in stratified deductive databases, in preparation
– Johnson
|
|
