Probabilistic Databases
From MaRDI portal
Publication:3100961
DOI10.2200/S00362ED1V01Y201105DTM016zbMath1237.68012OpenAlexW4211035117MaRDI QIDQ3100961
Christoph Koch, Dan Suciu, Dan Olteanu, Christopher Re
Publication date: 22 November 2011
Published in: Synthesis Lectures on Data Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2200/s00362ed1v01y201105dtm016
Database theory (68P15) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (43)
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations ⋮ Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points ⋮ Provenance Circuits for Trees and Treelike Instances ⋮ Certain answers as objects and knowledge ⋮ \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs ⋮ Logical Foundations of Possibilistic Keys ⋮ Uncertain probabilistic range queries on multidimensional data ⋮ Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints ⋮ Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data ⋮ Connecting Width and Structure in Knowledge Compilation (Extended Version) ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ A relational database model and algebra integrating fuzzy attributes and probabilistic tuples ⋮ Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks ⋮ Probabilistic (logic) programming concepts ⋮ Range queries on uncertain data ⋮ Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries ⋮ On the progression of belief ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The uniform measure of simple regular sets of infinite trees ⋮ The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws ⋮ A general approach to reasoning with probabilities ⋮ Regression and progression in stochastic domains ⋮ Advanced SMT techniques for weighted model integration ⋮ Connecting knowledge compilation classes and width parameters ⋮ Approximate weighted model integration on DNF structures ⋮ Possibilistic keys ⋮ Query answering over inconsistent knowledge bases: a probabilistic approach ⋮ Computing possible and certain answers over order-incomplete data ⋮ Unnamed Item ⋮ Lifted graphical models: a survey ⋮ A temporal database forecasting algebra
This page was built for publication: Probabilistic Databases
