A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases

DOI10.1007/978-3-030-00338-8_3MaRDI QIDQ6163648zbMATH OpenOpenAlexFDO

Authors İsmail İlkan Ceylan, Thomas Lukasiewicz

Publication date 30 June 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ora.ox.ac.uk/objects/uuid:13cae303-2ea6-4c3c-8e28-570924116ea6

zbMATH Keywords

query answeringprobabilistic reasoningprobabilistic databasesdata complexityprobabilistic knowledge bases

Mathematics Subject Classification ID

Knowledge representation (68T30) Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• Query processing on probabilistic data: a survey
• Introduction to Probabilistic Ontologies
• Open-world probabilistic databases: semantics, algorithms, complexity
• Probabilistic databases
• Probabilistic inductive querying using \texttt{ProbLog}

Cites work

• scientific article; zbMATH DE number 1216123 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Complexity Results for Probabilistic Datalog
• Computational Complexity of Probabilistic Turing Machines
• Data exchange: semantics and query answering
• Elements of finite model theory.
• Homomorphism preservation theorems
• Incomplete Information in Relational Databases
• Linking Data to Ontologies
• Markov logic networks
• Modeling and Reasoning with Bayesian Networks
• Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
• PP is closed under intersection
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
• Probabilistic databases
• Probabilistic graphical models.
• Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
• Taming the infinite chase: query answering under expressive relational constraints
• The Bayesian ontology language \(\mathcal {BEL}\)
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Description Logic Handbook
• The complexity of combinatorial problems with succinct input representation
• The complexity of computing the permanent
• The dichotomy of probabilistic inference for unions of conjunctive queries
• The independent choice logic for modelling multiple agents under uncertainty
• Towards more expressive ontology languages: the query answering problem
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia

Cited in

(9)

• The Probabilistic Description Logic
• Introduction to Probabilistic Ontologies
• Complexity of threshold query answering in probabilistic ontological data exchange
• Query processing on probabilistic data: a survey
• Probabilistic Hybrid Knowledge Bases Under the Distribution Semantics
• Analyzing real-world SPARQL queries and ontology-based data access in the context of probabilistic data
• Open-world probabilistic databases: semantics, algorithms, complexity
• Exploiting uncertainty for querying inconsistent description logics knowledge bases
• Explanation-friendly query answering under uncertainty

This page was built for publication: A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6163648)