#### DMCA

## On the decidability and complexity of query answering over inconsistent and incomplete databases (2003)

Venue: | In Proc. of PODS 2003 |

Citations: | 145 - 28 self |

### Citations

2792 | Computational complexity
- Papadimitriou
- 1994
(Show Context)
Citation Context ... is no answer to the query in the complete semantics, whereas anss(q, DB, D) = {b, d, f}. 2.3 Complexity classes Finally, we briefly recall the complexity classes mentioned in the paper, and refer to =-=[22]-=- for further details. P A (NP A ) is the class of problems that are solved in polynomial time by a deterministic (nondeterministic) Turing machine using an oracle for A, i.e., that solves in constant ... |

1836 |
V.: Foundations of Databases
- Abiteboul, Hull, et al.
- 1995
(Show Context)
Citation Context ...data that are inconsistent with respect to the global view of the sources. 1. INTRODUCTION In database applications, integrity constraints represent fundamental knowledge about the domain of interest =-=[8, 1]-=-. In many scenarios, data may not satisfy integrity constraints; this happens, for instance, in data integration [20, 17], where integrity constraints enrich the semantics of the global view of a set ... |

937 | Data Integration: A Theoretical Perspective
- Lenzerini
- 2002
(Show Context)
Citation Context ...tegrity constraints represent fundamental knowledge about the domain of interest [8, 1]. In many scenarios, data may not satisfy integrity constraints; this happens, for instance, in data integration =-=[20, 17]-=-, where integrity constraints enrich the semantics of the global view of a set of autonomous information sources, while such constraints may be violated by data at the sources [14, 6]. In principle, t... |

907 |
On the logic of theory change: Partial meet contraction and revision functions
- Alchourròn, Gärdenfors, et al.
- 1985
(Show Context)
Citation Context ...nswering also hold for the conjunctive query containment problem. 6.2 Related work The problem of reasoning with inconsistent databases is closely related to the studies in belief revision and update =-=[2]-=-. This area of Artificial Intelligence studies the problem of integrating new information with previous knowledge. In general, the problem is studied in a logical framework, in which the new informati... |

552 | Answering queries using views: A survey
- Halevy
(Show Context)
Citation Context ...tegrity constraints represent fundamental knowledge about the domain of interest [8, 1]. In many scenarios, data may not satisfy integrity constraints; this happens, for instance, in data integration =-=[20, 17]-=-, where integrity constraints enrich the semantics of the global view of a set of autonomous information sources, while such constraints may be violated by data at the sources [14, 6]. In principle, t... |

410 | L.: Data exchange: Semantics and query answering
- Fagin, Kolaitis, et al.
- 2005
(Show Context)
Citation Context ...ata integration [20, 17], where integrity constraints enrich the semantics of the global view of a set of autonomous information sources, while such constraints may be violated by data at the sources =-=[14, 6]-=-. In principle, the issue of dealing with integrity constraint violations is relevant in all applications involving the integration of heterogeneous information (e.g., Data Warehouses, Enterprise Reso... |

360 | Consistent query answers in inconsistent databases
- Arenas, Bertossi, et al.
- 1999
(Show Context)
Citation Context ... Sistemistica Università di Roma “La Sapienza” Via Salaria 113, I-00198 Roma, Italy {cali,lembo,rosati}@dis.uniroma1.it have proposed a new semantic approach to the treatment of integrity constraints =-=[15, 11, 5, 21, 3, 4, 19, 16]-=-, which we briefly illustrate in the following. Traditionally, database theory adopts an exact interpretation of data, based on the closed world assumption [23], i.e., the interpretation of each relat... |

322 |
On closed world data bases
- Reiter
- 1978
(Show Context)
Citation Context ...ty constraints [15, 11, 5, 21, 3, 4, 19, 16], which we briefly illustrate in the following. Traditionally, database theory adopts an exact interpretation of data, based on the closed world assumption =-=[23]-=-, i.e., the interpretation of each relation r exactly corresponds to the extension of r in the database instance. In order to cope with data inconsistencies, other assumptions about data are adopted i... |

213 | On the complexity of propositional knowledge base revision, updates, and counterfactuals
- Eiter, Gottlob
- 1992
(Show Context)
Citation Context ...lt. Figure 1: Complexity of query answering under KDs and IDs (decision problem) results mostly concern a setting in which knowledge is specified in terms of propositional formulae of classical logic =-=[12, 13]-=-. Instead, the typical database setting is considered by the literature on inconsistent databases, which we briefly survey in the following. The notion of consistent query answers over inconsistent da... |

149 | On the Semantics of Updates in Databases
- Fagin, Ullman, et al.
- 1983
(Show Context)
Citation Context ... Sistemistica Università di Roma “La Sapienza” Via Salaria 113, I-00198 Roma, Italy {cali,lembo,rosati}@dis.uniroma1.it have proposed a new semantic approach to the treatment of integrity constraints =-=[15, 11, 5, 21, 3, 4, 19, 16]-=-, which we briefly illustrate in the following. Traditionally, database theory adopts an exact interpretation of data, based on the closed world assumption [23], i.e., the interpretation of each relat... |

146 |
Testing containment of conjunctive queries under functional and inclusion dependencies
- JOHNSON, KLUG
- 1984
(Show Context)
Citation Context ...ts of this paper is presented in Section 6 (see Figure 1). We remark that the results we have obtained for the sound semantics extend previous studies on query containment under integrity constraints =-=[18]-=-, while the results for the loose semantics extend known results in the field of inconsistent databases, by taking into account inclusion dependencies, which add significant complexity to the problem.... |

127 | Minimal-Change Integrity Maintenance Using Tuple Deletions
- Chomicki, Marcinkowski
- 2005
(Show Context)
Citation Context ...efined on a setcontainment ordering between databases, which corresponds to the loosely-exact semantics of our framework. Moreover, a different semantics for database repairing has been considered in =-=[10, 9]-=-. Specifically, in such works a semantics is defined in which only tuple elimination is allowed; therefore, the problem of dealing with infinite models is not addressed. Then, a preference order over ... |

113 | Data integration under integrity constraints
- Calı̀, Calvanese, et al.
- 2002
(Show Context)
Citation Context ...ly if t ∈ q chase(DB,D) . Proof (sketch). “⇒” Since chase(DB, D) satisfies I, it belongs to sems(DB, D). From the definition of ans s(q, DB, D), it follows that t ∈ q chase(DB,D) . “⇐” Analogously to =-=[7]-=-, it can be proved by induction on the structure of chase(DB, D) that, for any database instance B ∈ sems(DB, D), there exists a homomorphism µ that sends the tuples of chase(DB, D) to the tuples of B... |

98 | Inclusion dependencies and their interaction with functional dependencies
- Casanova, Fagin, et al.
- 1982
(Show Context)
Citation Context ...data that are inconsistent with respect to the global view of the sources. 1. INTRODUCTION In database applications, integrity constraints represent fundamental knowledge about the domain of interest =-=[8, 1]-=-. In many scenarios, data may not satisfy integrity constraints; this happens, for instance, in data integration [20, 17], where integrity constraints enrich the semantics of the global view of a set ... |

86 | Merging databases under constraints
- Lin, Mendelzon
- 1998
(Show Context)
Citation Context ... Sistemistica Università di Roma “La Sapienza” Via Salaria 113, I-00198 Roma, Italy {cali,lembo,rosati}@dis.uniroma1.it have proposed a new semantic approach to the treatment of integrity constraints =-=[15, 11, 5, 21, 3, 4, 19, 16]-=-, which we briefly illustrate in the following. Traditionally, database theory adopts an exact interpretation of data, based on the closed world assumption [23], i.e., the interpretation of each relat... |

58 |
A logic programming approach to the integration, repairing and querying of inconsistent databases
- Greco, Greco, et al.
(Show Context)
Citation Context |

54 | Specifying and querying database repairs using logic programs with exceptions - Arenas, Bertossi, et al. - 2000 |

44 |
Source inconsistency and incompleteness in data integration
- Lembo, Lenzerini, et al.
- 2002
(Show Context)
Citation Context ...e in which sem x(DB, D) = ∅ (x ∈ {e, s}). This does not seem reasonable when the violations are due to a small set of facts. According to a common approach in the literature on inconsistent databases =-=[15, 21, 3, 19]-=-, we now introduce less strict assumptions on data, under which we can get consistent answers from inconsistent database instances. Example 2.1 (contd.). As we have already shown, seme(DB, D) = ∅ sinc... |

37 | Query Answering in Information Systems with Integrity Constraints
- BRY
- 1997
(Show Context)
Citation Context |

31 | Accessing data integration systems through conceptual schemas
- Calì, Calvanese, et al.
- 2001
(Show Context)
Citation Context ...ata integration [20, 17], where integrity constraints enrich the semantics of the global view of a set of autonomous information sources, while such constraints may be violated by data at the sources =-=[14, 6]-=-. In principle, the issue of dealing with integrity constraint violations is relevant in all applications involving the integration of heterogeneous information (e.g., Data Warehouses, Enterprise Reso... |

20 | Integrating data from possibly inconsistent databases
- Dung
- 1996
(Show Context)
Citation Context |

17 | The complexity of nested counterfactuals and iterated knowledge base revisions
- Eiter, Gottlob
- 1996
(Show Context)
Citation Context ...lt. Figure 1: Complexity of query answering under KDs and IDs (decision problem) results mostly concern a setting in which knowledge is specified in terms of propositional formulae of classical logic =-=[12, 13]-=-. Instead, the typical database setting is considered by the literature on inconsistent databases, which we briefly survey in the following. The notion of consistent query answers over inconsistent da... |

13 | On the Computational Complexity of Consistent Query Answers
- CHOMICKI, MARCINKOWSKI
(Show Context)
Citation Context ... in polynomial time. We prove coNP-hardness of the problem even if we restrict to database schemata without IDs. Actually, this hardness result can be immediately derived from the results reported in =-=[10]-=- (although obtained under a different semantics): however, in the following we provide an alternative proof, in which we use a reduction of the 3-colorability problem to our problem. Consider a graph ... |