Open-world probabilistic databases: semantics, algorithms, complexity

DOI10.1016/j.artint.2021.103474OpenAlexW3132053208MaRDI QIDQ2238646

Guy Van den Broeck, İsmail İlkan Ceylan, Adnan Darwiche

Publication date: 2 November 2021

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:83a1134e-2a50-41ed-8250-f1fa88cc0c94

zbMATH Keywords

learningsemanticsinferencedichotomydata complexityknowledge basesprobabilistic databaseslifted inferenceopen-world assumptionclosed-world assumptioncredal sets

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (4)

On measuring inconsistency in definite and indefinite databases with denial constraints ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximate weighted model integration on DNF structures

Uses Software

• ProbLog
• MYSTIQ
• YAGO
• ProBase
• Tuffy
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Knowledge compilation meets database theory: compiling queries to decision diagrams
• YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
• The complexity of computing the permanent
• Elements of finite model theory.
• The complexity of combinatorial problems with succinct input representation
• A logic for default reasoning
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
• The independent choice logic for modelling multiple agents under uncertainty
• Credal networks
• PP is closed under intersection
• Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
• On probabilistic inference by weighted model counting
• Probabilistic Databases
• An Introduction to Conditional Random Fields
• The complexity of acyclic conjunctive queries
• Modeling and Reasoning with Bayesian Networks
• Monte-Carlo approximation algorithms for enumeration problems
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Computational Complexity of Probabilistic Turing Machines
• Complexity Results for Probabilistic Datalog
• Ontology-Based Data Access
• Dichotomies for Queries with Negation in Probabilistic Databases
• The Description Logic Handbook
• Query Processing on Probabilistic Data: A Survey
• On the Semantics and Complexity of Probabilistic Logic Programs
• The dichotomy of probabilistic inference for unions of conjunctive queries
• The complexity of theorem-proving procedures
• A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
• Stochastic Boolean satisfiability

This page was built for publication: Open-world probabilistic databases: semantics, algorithms, complexity