Pages that link to "Item:Q5395698"

The following pages link to The dichotomy of probabilistic inference for unions of conjunctive queries (Q5395698):

Displaying 22 items.

• Knowledge compilation meets database theory: compiling queries to decision diagrams (Q359877) (← links)
• A dichotomy in the complexity of counting database repairs (Q389240) (← links)
• Skyline ranking for uncertain databases (Q726402) (← links)
• A dichotomy in the complexity of consistent query answering for queries with two atoms (Q763497) (← links)
• Computational complexity of queries based on itemsets (Q844194) (← links)
• Range queries on uncertain data (Q897858) (← links)
• Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data (Q1678449) (← links)
• The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
• Query answering over inconsistent knowledge bases: a probabilistic approach (Q2084950) (← links)
• Chance constraint as a basis for probabilistic query model (Q2140447) (← links)
• Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
• Estimating latent feature-feature interactions in large feature-rich graphs (Q3389688) (← links)
• Dichotomies for Queries with Negation in Probabilistic Databases (Q5012549) (← links)
• (Q5028455) (← links)
• Uniform Reliability of Self-Join-Free Conjunctive Queries (Q5060188) (← links)
• An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
• (Q5094118) (← links)
• (Q5155685) (← links)
• Lifted inference with tree axioms (Q6088316) (← links)
• An epistemic approach to model uncertainty in data-graphs (Q6137843) (← links)
• A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases (Q6163648) (← links)
• Database repairing with soft functional dependencies (Q6536405) (← links)