Name
Abstract | ||
|---|---|---|
This paper studies a strong form of disjunctive information in deductive databases. The basic idea is that a disjunctionA ?B should be considered true only in the case when neitherA norB can be inferred, but the disjunctionA ?B is true. Under this interpretation, databases may be inconsistent. For those databases that are consistent, it is shown that a unique minimal model exists. We study a fixpoint theory and present a sound and complete proof procedure for query processing in consistent databases. For a class of inconsistent databases, we obtain a declarative semantics by selecting an interpretation that maximizes satisfaction, and minimizes indefiniteness. Two notions of negation are introduced. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/BF00881796 | J. Autom. Reasoning |
Keywords | DocType | Volume |
Disjunctive logic programs,strong disjunctive database (SDD) | Journal | 10 |
Issue | ISSN | Citations |
3 | 0168-7433 | 1 |
PageRank | References | Authors |
0.35 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James J. Lu | 1 | 520 | 118.05 |
| Monica D. Barback | 2 | 15 | 19.30 |
| Lawrence J. Henschen | 3 | 478 | 280.94 |