MayBMS
From MaRDI portal
Software:31890
swMATH20068MaRDI QIDQ31890FDOQ31890
Author name not available (Why is that?)
Cited In (11)
- Not all FPRASs are equal: demystifying FPRASs for DNF-counting
- A Probabilistic Interpretation for a Geometric Similarity Measure
- Transducing Markov sequences
- Title not available (Why is that?)
- Infinite Probabilistic Databases
- Range queries on uncertain data
- Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- The complexity of Bayesian networks specified by propositional and relational languages
- Consistency checking and querying in probabilistic databases under integrity constraints
- A dichotomy in the complexity of counting database repairs
This page was built for software: MayBMS
