On the data complexity of consistent query answering (Q269317): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00224-014-9586-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-014-9586-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029695031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on the complexity of consistent conjunctive query answering under primary key violations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer sets for consistent query answering in inconsistent databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Querying the Guarded Fragment / rank
 
Normal rank
Property / cites work
 
Property / cites work: XPath satisfiability in the presence of DTDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order query rewriting for inconsistent databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal-change integrity maintenance using tuple deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clauses and database dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data exchange: semantics and query answering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data exchange: getting to the core / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient core computation in data exchange / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy in the complexity of consistent query answering for queries with two atoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite controllability of conjunctive query answering in databases under open-world assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the data complexity of consistent query answering / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00224-014-9586-0 / rank
 
Normal rank

Latest revision as of 13:02, 9 December 2024

scientific article
Language Label Description Also known as
English
On the data complexity of consistent query answering
scientific article

    Statements

    On the data complexity of consistent query answering (English)
    0 references
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    inconsistent databases
    0 references
    constraints
    0 references
    repairs
    0 references
    consistent answers
    0 references

    Identifiers