Probabilistic query answering over inconsistent databases
From MaRDI portal
Publication:454142
DOI10.1007/s10472-012-9287-9zbMath1250.68097OpenAlexW2043023694WikidataQ62047422 ScholiaQ62047422MaRDI QIDQ454142
Cristian Molinaro, Sergio Greco
Publication date: 1 October 2012
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-012-9287-9
Database theory (68P15) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Probabilistic query answering over inconsistent databases ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach
Cites Work
- Unnamed Item
- Unnamed Item
- Probabilistic query answering over inconsistent databases
- First-order query rewriting for inconsistent databases
- Minimal-change integrity maintenance using tuple deletions
- A three-valued semantics for querying and repairing inconsistent databases
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Aggregate operators in probabilistic databases
- Querying and Repairing Inconsistent Databases Under Three-Valued Semantics
- Incomplete Information in Relational Databases
- The Complexity of Enumeration and Reliability Problems
- Answer sets for consistent query answering in inconsistent databases
- Database Theory - ICDT 2005
- Representation of Partial Knowledge and Query Answering in Locally Complete Databases
- Database Programming Languages
- Database Programming Languages
This page was built for publication: Probabilistic query answering over inconsistent databases