On the data complexity of consistent query answering
From MaRDI portal
Recommendations
Cites work
- A dichotomy in the complexity of consistent query answering for queries with two atoms
- A remark on the complexity of consistent conjunctive query answering under primary key violations
- Answer sets for consistent query answering in inconsistent databases
- Data exchange: getting to the core
- Data exchange: semantics and query answering
- Efficient core computation in data exchange
- First-order query rewriting for inconsistent databases
- Horn clauses and database dependencies
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1953134 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Minimal-change integrity maintenance using tuple deletions
- On the data complexity of consistent query answering
- On the finite controllability of conjunctive query answering in databases under open-world assumption
- Querying the Guarded Fragment
- Taming the infinite chase: query answering under expressive relational constraints
- The core of a graph
- Why is it hard to obtain a dichotomy for consistent query answering?
- XPath satisfiability in the presence of DTDs
Cited in
(37)- Repair position selection for inconsistent data
- Consistent query answering for primary keys in Datalog
- On the complexity and approximability of repair position selection problem
- Query answering over inconsistent knowledge bases: a probabilistic approach
- A SAT-based system for consistent query answering
- Counting and enumerating preferred database repairs
- Repair-based degrees of database inconsistency
- On the data complexity of consistent query answering over graph databases
- From causes for database queries to repairs and model-based diagnosis and back
- A three-valued semantics for querying and repairing inconsistent databases
- Computational methods for database repair by signed formulae
- Efficient and optimal query answering on independent schemes
- On the data complexity of consistent query answering
- On the complexity of query result diversification
- Sampling query feedback restricted repairs of functional dependency violations: complexity and algorithm
- Why is it hard to obtain a dichotomy for consistent query answering?
- An argumentation-based approach to database repair
- Detecting ambiguity in prioritized database repairing
- Querying and Repairing Inconsistent Databases Under Three-Valued Semantics
- scientific article; zbMATH DE number 2080463 (Why is no real title available?)
- Probabilistic query answering over inconsistent databases
- First-order under-approximations of consistent query answers
- Why is it hard to obtain a dichotomy for consistent query answering?
- Complexity of repair checking and consistent query answering
- Advances in Databases and Information Systems
- Database Programming Languages
- On the data complexity of consistent query answering over graph databases
- Foundations of Information and Knowledge Systems
- Complexity thresholds in inclusion logic
- Measuring and computing database inconsistency via repairs
- Paraconsistent logic and query answering in inconsistent databases
- On the Complexity of Finding Set Repairs for Data-Graphs
- An epistemic approach to model uncertainty in data-graphs
- On the complexity of queries in the logical data model
- Inconsistency-tolerant semantics based on (preferred) repairs (invited paper)
- On the complexity of sampling query feedback restricted database repair of functional dependency violations
- Disjunctive databases for representing repairs
This page was built for publication: On the data complexity of consistent query answering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269317)
