scientific article; zbMATH DE number 7471691

MaRDI QIDQ5028455

Antoine Amarilli, İsmail İlkan Ceylan

Publication date: 9 February 2022

Full work available at URL: https://arxiv.org/abs/1910.02048

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

probabilistic databases\#P-hardnessprobabilistic graphsdata complexity dichotomyinfinite unions of conjunctive queriesprobabilistic query evaluation

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (2)

Uniform Reliability of Self-Join-Free Conjunctive Queries ⋮ Lifted inference with tree axioms

Uses Software

• YAGO

Cites Work

• Unnamed Item
• YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
• Open-world probabilistic databases: semantics, algorithms, complexity
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Probabilistic Databases
• Undecidable boundedness problems for datalog programs
• Undecidable optimization problems for database logic programs
• Provenance Circuits for Trees and Treelike Instances
• On Datalog vs. LFP
• Ontology-Based Data Access
• Dichotomies for Queries with Negation in Probabilistic Databases
• The dichotomy of probabilistic inference for unions of conjunctive queries
• The complexity of theorem-proving procedures

This page was built for publication: