4.3 Article

Querying Incomplete Data: Complexity and Tractability via Datalog and First-Order Rewritings

Related references

Note: Only part of the references are listed.
Proceedings Paper Computer Science, Information Systems

Certain Answers Meet Zero-One Laws

Leonid Libkin

PODS'18: PROCEEDINGS OF THE 37TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (2018)

Article Computer Science, Theory & Methods

Certain Answers over Incomplete XML Documents: Extending Tractability Boundary

Amelie Gheerbrant et al.

THEORY OF COMPUTING SYSTEMS (2015)

Proceedings Paper Computer Science, Artificial Intelligence

Ontology-Mediated Query Answering with Data-Tractable Description Logics

Meghyn Bienvenu et al.

REASONING WEB: WEB LOGIC RULES (2015)

Article Computer Science, Theory & Methods

EFFICIENT APPROXIMATIONS OF CONJUNCTIVE QUERIES

Pablo Barcelo et al.

SIAM JOURNAL ON COMPUTING (2014)

Article Computer Science, Information Systems

The LLUNATIC Data-Cleaning Framework

Floris Geerts et al.

PROCEEDINGS OF THE VLDB ENDOWMENT (2013)

Article Computer Science, Theory & Methods

View-based query processing: On the relationship between rewriting, answering and losslessness

Diego Calvanese et al.

THEORETICAL COMPUTER SCIENCE (2007)

Article Computer Science, Information Systems

Data exchange: Getting to the core

R Fagin et al.

ACM TRANSACTIONS ON DATABASE SYSTEMS (2005)

Article Computer Science, Information Systems

Exact complexity of Exact-Four-Colorability

J Rothe

INFORMATION PROCESSING LETTERS (2003)

Article Computer Science, Theory & Methods

Expressive power of SQL

L Libkin

THEORETICAL COMPUTER SCIENCE (2003)

Article Computer Science, Hardware & Architecture

Logics with aggregate operators

L Hella et al.

JOURNAL OF THE ACM (2001)