A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases

DOI10.1007/978-3-030-00338-8_3zbMATH Open1517.68100OpenAlexW2888942263MaRDI QIDQ6163648

İ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)

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?)
• Modeling and Reasoning with Bayesian Networks
• Incomplete Information in Relational Databases
• Linking Data to Ontologies
• The complexity of computing the permanent
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The Description Logic Handbook
• Elements of finite model theory.
• Taming the infinite chase: query answering under expressive relational constraints
• Data exchange: semantics and query answering
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
• Markov logic networks
• 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
• Probabilistic Databases
• YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia
• PP is closed under intersection
• Homomorphism preservation theorems
• Towards more expressive ontology languages: the query answering problem
• Uniform constant-depth threshold circuits for division and iterated multiplication.
• The dichotomy of probabilistic inference for unions of conjunctive queries
• The Bayesian ontology language \(\mathcal {BEL}\)
• Complexity Results for Probabilistic Datalog

Cited In (2)

• The Probabilistic Description Logic
• Probabilistic Hybrid Knowledge Bases Under the Distribution Semantics

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)