Complexity Results for Probabilistic Datalog
From MaRDI portal
Recommendations
- On the semantics and complexity of probabilistic logic programs
- Complexity results for probabilistic answer set programming
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
- Complexity for probability logic with quantifiers over propositions
- The complexity of satisfiability in non-iterated and iterated probabilistic logics
- Probabilistic logic under coherence: complexity and algorithms
- Decidability of finite probabilistic propositional dynamic logics
- Probabilization of logics: completeness and decidability
- The complexity of inferences and explanations in probabilistic logic programming
Cited in
(12)- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference
- Open-world probabilistic databases: semantics, algorithms, complexity
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Complexity results for probabilistic answer set programming
- Consistency checking and querying in probabilistic databases under integrity constraints
- Inconsistency-tolerant query answering: rationality properties and computational complexity analysis
- Complexity of threshold query answering in probabilistic ontological data exchange
- The dichotomy of evaluating homomorphism-closed queries on probabilistic graphs
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- Combining intensional with extensional query evaluation in tuple independent probabilistic databases
- Languages for probabilistic modeling over structured and relational domains
- Exploiting uncertainty for querying inconsistent description logics knowledge bases
This page was built for publication: Complexity Results for Probabilistic Datalog
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576254)
