Open-world probabilistic databases: semantics, algorithms, complexity
From MaRDI portal
Publication:2238646
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
learninginferencesemanticsdichotomyknowledge basesprobabilistic databaseslifted inferencedata complexityopen-world assumptionclosed-world assumptioncredal sets
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling and Reasoning with Bayesian Networks
- The complexity of computing the permanent
- The Description Logic Handbook
- The complexity of theorem-proving procedures
- Elements of finite model theory.
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
- On probabilistic inference by weighted model counting
- Ontology-Based Data Access
- The independent choice logic for modelling multiple agents under uncertainty
- Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
- Computational Complexity of Probabilistic Turing Machines
- The complexity of combinatorial problems with succinct input representation
- Monte-Carlo approximation algorithms for enumeration problems
- The complexity of acyclic conjunctive queries
- A logic for default reasoning
- Probabilistic Databases
- Credal networks
- An Introduction to Conditional Random Fields
- YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
- PP is closed under intersection
- Stochastic Boolean satisfiability
- Knowledge compilation meets database theory: compiling queries to decision diagrams
- Query Processing on Probabilistic Data: A Survey
- The dichotomy of probabilistic inference for unions of conjunctive queries
- On the Semantics and Complexity of Probabilistic Logic Programs
- Dichotomies for Queries with Negation in Probabilistic Databases
- Complexity Results for Probabilistic Datalog
- A Dichotomy for Homomorphism-Closed Queries on Probabilistic Graphs
Cited In (8)
- Logic Programming
- Knowledge is power: open-world knowledge representation learning for knowledge-based visual reasoning
- Title not available (Why is that?)
- On the representation and querying of sets of possible worlds
- Title not available (Why is that?)
- On measuring inconsistency in definite and indefinite databases with denial constraints
- Monads for measurable queries in probabilistic databases
- Approximate weighted model integration on DNF structures
Uses Software
This page was built for publication: Open-world probabilistic databases: semantics, algorithms, complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238646)
