Conference item icon

Conference item

Complexity results for probabilistic datalog±

Abstract:

We study the query evaluation problem in probabilistic databases in the presence of probabilistic existential rules. Our focus is on the Datalog± family of languages for which we define the probabilistic counterpart using a flexible and compact encoding of probabilities. This formalism can be viewed as a generalization of probabilistic databases, as it allows to generate new facts from the given ones, using so-called tuple-generating dependencies, or existential rules. We study the computatio...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.3233/978-1-61499-672-9-1414

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author

Contributors

Role:
Editor
Role:
Editor
Publisher:
IOS Press Publisher's website
Journal:
2nd European Conference on Artificial Intelligence Journal website
Host title:
22nd European Conference on Artificial Intelligence‚ ECAI 2016
Publication date:
2016-06-01
Acceptance date:
2016-06-08
Event location:
The Hague‚ The Netherlands
Event start date:
2016-08-29T00:00:00Z
DOI:
Source identifiers:
631618
Pubs id:
pubs:631618
UUID:
uuid:c45f4302-904f-40ca-ac89-04cf4fd62a08
Local pid:
pubs:631618
Deposit date:
2016-07-03

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP