Open-world probabilistic databases: semantics, algorithms, complexity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 2046116 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
- A logic for default reasoning
- An introduction to conditional random fields
- Complexity Results for Probabilistic Datalog
- Computational Complexity of Probabilistic Turing Machines
- Credal networks
- Dichotomies for Queries with Negation in Probabilistic Databases
- Elements of finite model theory.
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- Modeling and Reasoning with Bayesian Networks
- Monte-Carlo approximation algorithms for enumeration problems
- On hashing-based approaches to approximate DNF-counting
- On probabilistic inference by weighted model counting
- On the semantics and complexity of probabilistic logic programs
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- PP is closed under intersection
- Pattern recognition and machine learning.
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- Probabilistic databases
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Query processing on probabilistic data: a survey
- Stochastic Boolean satisfiability
- The Description Logic Handbook
- The complexity of acyclic conjunctive queries
- The complexity of combinatorial problems with succinct input representation
- The complexity of computing the permanent
- The complexity of theorem-proving procedures
- The dichotomy of probabilistic inference for unions of conjunctive queries
- The independent choice logic for modelling multiple agents under uncertainty
- YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
Cited in
(11)- Logic Programming
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Knowledge is power: open-world knowledge representation learning for knowledge-based visual reasoning
- scientific article; zbMATH DE number 7566047 (Why is no real title available?)
- On the representation and querying of sets of possible worlds
- Independence in Infinite Probabilistic Databases
- scientific article; zbMATH DE number 7471691 (Why is no real title available?)
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Monads for measurable queries in probabilistic databases
- Approximate weighted model integration on DNF structures
This page was built for publication: Open-world probabilistic databases: semantics, algorithms, complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238646)
