Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
An analysis of first-order logics of probability
Artificial Intelligence
A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
SIAM Journal on Computing
A brief survey of web data extraction tools
ACM SIGMOD Record
MYSTIQ: a system for finding more answers by using probabilities
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Creating probabilistic databases from information extraction models
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
The Description Logic Handbook
The Description Logic Handbook
Efficient query evaluation on probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Homomorphism preservation theorems
Journal of the ACM (JACM)
Monte-Carlo algorithms for enumeration and reliability problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Managing uncertainty and vagueness in description logics for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Probabilistic databases: diamonds in the dirt
Communications of the ACM - Barbara Liskov: ACM's A.M. Turing Award Winner
Fast and Simple Relational Processing of Uncertain Data
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The VLDB Journal — The International Journal on Very Large Data Bases
Computing query probability with incidence algebras
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic Databases
Conjunctive query answering in probabilistic datalog+/- ontologies
RR'11 Proceedings of the 5th international conference on Web reasoning and rule systems
DIADEM: domain-centric, intelligent, automated data extraction methodology
Proceedings of the 21st international conference companion on World Wide Web
Top-k retrieval for ontology mediated access to relational databases
Information Sciences: an International Journal
The dichotomy of probabilistic inference for unions of conjunctive queries
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We propose a framework for querying probabilistic instance data in the presence of an OWL2 QL ontology, arguing that the interplay of probabilities and ontologies is fruitful in many applications such as managing data that was extracted from the web. The prime inference problem is computing answer probabilities, and it can be implemented using standard probabilistic database systems. We establish a PTime vs. #P dichotomy for the data complexity of this problem by lifting a corresponding result from probabilistic databases. We also demonstrate that query rewriting (backwards chaining) is an important tool for our framework, show that non-existence of a rewriting into first-order logic implies #P-hardness, and briefly discuss approximation of answer probabilities.