English
Related papers

Related papers: Second-Order Specifications and Quantifier Elimina…

200 papers

A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the constraints. In this paper we apply logic programming based on…

Databases · Computer Science 2007-05-23 Marcelo Arenas , Leopoldo Bertossi , Jan Chomicki

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how…

Databases · Computer Science 2011-10-10 Slawomir Staworko , Jan Chomicki , Jerzy Marcinkowski

In this work we establish and investigate connections between causes for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis. The first two are relatively new research areas in databases,…

Databases · Computer Science 2016-10-25 Leopoldo Bertossi , Babak Salimi

In this work we establish and investigate connections between causality for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis. The first two are relatively new problems in databases, and…

Databases · Computer Science 2014-12-16 Babak Salimi , Leopoldo Bertossi

We consider here the problem of obtaining reliable, consistent information from inconsistent databases -- databases that do not have to satisfy given integrity constraints. We use the notion of consistent query answer -- a query answer…

Databases · Computer Science 2007-05-23 Jan Chomicki , Jerzy Marcinkowski

In this work we establish and investigate the connections between causality for query answers in databases, database repairs wrt. denial constraints, and consistency-based diagnosis. The first two are relatively new problems in databases,…

Databases · Computer Science 2014-07-01 Babak Salimi , Leopoldo Bertossi

Consistent query answering is an inconsistency tolerant approach to obtaining semantically correct answers from a database that may be inconsistent with respect to its integrity constraints. In this work we formalize the notion of…

Databases · Computer Science 2011-06-09 M. Andrea Rodríguez , Leopoldo Bertossi , Monica Caniupan

The problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input…

Databases · Computer Science 2007-05-23 Sergio Flesca , Filippo Furfaro , Francesco Parisi

A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering (CQA) is the problem of computing from D the answers to a query that are consistent wrt IC . Consistent answers are invariant under all…

Databases · Computer Science 2016-05-24 Andrei Lopatenko , Leopoldo Bertossi

We introduce a general abstract framework for database repairs, where the repair notions are defined using formal logic. We distinguish between integrity constraints and so-called query constraints. The former are used to model consistency…

Databases · Computer Science 2025-03-31 Nicolas Fröhlich , Arne Meier , Nina Pardal , Jonni Virtema

In this paper we consider two points of views to the problem of coherent integration of distributed data. First we give a pure model-theoretic analysis of the possible ways to `repair' a database. We do so by characterizing the…

Logic in Computer Science · Computer Science 2007-05-23 Ofer Arieli , Marc Denecker , Bert Van Nuffelen , Maurice Bruynooghe

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the database, as a whole, may fail to satisfy. Consistent answers…

Databases · Computer Science 2007-05-23 Andrei Lopatenko , Leopoldo Bertossi

This paper revisits the problem of repairing and querying inconsistent databases equipped with universal constraints. We adopt symmetric difference repairs, in which both deletions and additions of facts can be used to restore consistency,…

Databases · Computer Science 2025-09-12 Meghyn Bienvenu , Camille Bourgaux

A correspondence between database tuples as causes for query answers in databases and tuple-based repairs of inconsistent databases with respect to denial constraints has already been established. In this work, answer-set programs that…

Databases · Computer Science 2020-09-30 Leopoldo Bertossi

We investigate the notion of sufficient explanation, and a sufficiency-degree as attribution score for database tuples in relation to query answering. We also investigate and exploit connections with database repairs as used for dealing…

Databases · Computer Science 2026-05-18 Leopoldo Bertossi , Nina Pardal

Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole may fail to satisfy. Those answers are characterized as those…

Databases · Computer Science 2007-05-23 L. Bertossi , L. Bravo , E. Franconi , A. Lopatenko

Consistent Query Answering (CQA) is an inconsistency-tolerant approach to data access in knowledge bases and databases. The goal of CQA is to provide meaningful (consistent) answers to queries even in the presence of inconsistent…

Artificial Intelligence · Computer Science 2024-04-25 Lorenzo Marconi , Riccardo Rosati

In this work, answer-set programs that specify repairs of databases are used as a basis for solving computational and reasoning problems about causes for query answers from databases.

Databases · Computer Science 2017-06-27 Leopoldo Bertossi

We embark on a study of the consistent answers of queries over databases annotated with values from a naturally ordered positive semiring. In this setting, the consistent answers of a query are defined as the minimum of the semiring values…

Databases · Computer Science 2025-04-04 Phokion G. Kolaitis , Nina Pardal , Jonni Virtema , Jef Wijsen

For several reasons a database may not satisfy a given set of integrity constraints(ICs), but most likely most of the information in it is still consistent with those ICs; and could be retrieved when queries are answered. Consistent answers…

Databases · Computer Science 2007-05-23 Loreto Bravo , Leopoldo Bertossi
‹ Prev 1 2 3 10 Next ›