Abstract Databases may be inconsistent with respect to a given set of integrity constraints. Nevertheless, most of the data may be consistent. In this paper we show how to specify consistent data and how to query a relational database in such a way that only consistent data is retrieved. The specification and queries axe based on disjunctive extended logic programs with positive and negative exceptions that generalize those previously introduced by Kowalski and Sadfl. I
|
1654
|
Foundations of Logic Programming
– Lloyd
- 1984
|
|
1126
|
The Stable Model Semantics for Logic Programming
– Gelfond, Lifschitz
- 1988
|
|
1009
|
editors. Foundations of Databases
– Abiteboul, Hull, et al.
- 1995
|
|
554
|
Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365–385
– Gelfond, Lifschitz
- 1991
|
|
394
|
Abductive Logic Programming
– Kakas, Kowalski, et al.
- 1993
|
|
344
|
Information Integration Using Logical Views
– Ullman
- 1997
|
|
298
|
Logic programs with classical negation
– Gelfond, Lifschitz
- 1990
|
|
212
|
Principles of Database and
– Ullman
- 1989
|
|
185
|
D.S.: XSB as an efficient deductive database engine
– Sagonas, Swift, et al.
- 1994
|
|
141
|
Consistent query answers in inconsistent databases
– Arenas, Chomicki
- 1999
|
|
138
|
Disjunctive Datalog
– Eiter, Gottlob, et al.
- 1997
|
|
133
|
Propositional Semantics for Disjunctive Logic Programs
– Ben-Eliyahu, Dechter
- 1994
|
|
130
|
On the complexity of propositional knowledge base revision, updates and counterfactuals
– Eiter, Gottlob
- 1992
|
|
96
|
Combining knowledge bases consisting of first-order theories
– Baral, Kraus, et al.
|
|
82
|
Logic Programs with Exceptions
– Kowalski, Sadri
- 1990
|
|
75
|
Recursive Query Plans for Data Integration
– Duschka, Genesereth, et al.
|
|
62
|
Disjunctive stable models: Unfounded sets, fixpoint semantics and computation
– Leone, Rullo, et al.
- 1997
|
|
60
|
Merging databases under constraints
– Lin, Mendelzon
- 1998
|
|
42
|
Nonmonotonic reasoning by minimal belief revision
– Satoh
- 1988
|
|
39
|
Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases
– Agarwal, Keller, et al.
|
|
37
|
A Unified View of Propositional Knowledge Base Updates
– Katsuno, Mendelzon
- 1989
|
|
34
|
Query answering in information systems with integrity constraints
– Bry
- 1997
|
|
30
|
Querying Inconsistent Databases: Algorithms and Implementation
– Celle, Bertossi
- 1861
|
|
26
|
Scalar Aggregation in FD-Inconsistent Databases
– Arenas, Bertossi, et al.
- 1973
|
|
26
|
Pushing Goal Derivation in DLP Computations
– Faber, Leone, et al.
|
|
18
|
Integrating Data from Possibly Inconsistent Databases
– Dung
- 1996
|
|
15
|
Diagnosis and Repair of Constraint Violations
– Gertz
|
|
11
|
Belief Revision and Paraconsistency in a Logic Programming Framework
– Pimentel, Rodi
- 1991
|
|
11
|
On the Complexity of Propositional Knowledge
– Eiter, Gottlob
- 1992
|
|
2
|
Smodels - An Implementation of the Stable and Well-founded Semantics for Normal Logic Programs
– Niemela, Simons
- 1997
|
|
1
|
Combining Knowledge Bases Consisting ofFfist-Order Theories
– Baral, Kraus, et al.
|
|
1
|
Computation of Stabe Models and its Integration with Logical Query Processing
– Chen, Warren
- 1996
|
|
1
|
The Knowledge Representation System DVL: Progress Report, Comparisons, and Benchmarks
– Eiter, Leone, et al.
- 1998
|
|
1
|
Recursive Query Plans for Data Integration. Journal of Logic Programming, 2000. For example, the disjunctive logic program p p /, has fpg as a stable model, whereas the transformed program p / not p does not have fpg as a stable model
– Duschka, Genesereth, et al.
|
