Query Answering in Bayesian Description Logics
From International Center for Computational Logic
Query Answering in Bayesian Description Logics
İsmail İlkan Ceylanİsmail İlkan Ceylan
İsmail İlkan Ceylan
Query Answering in Bayesian Description Logics
In Diego Calvanese, Boris Konev, eds., Proceedings of the 28th International Workshop on Description Logics (DL 2015), volume 1350, 2015. CEUR Workshop Proceedings
Query Answering in Bayesian Description Logics
In Diego Calvanese, Boris Konev, eds., Proceedings of the 28th International Workshop on Description Logics (DL 2015), volume 1350, 2015. CEUR Workshop Proceedings
- KurzfassungAbstract
The Bayesian Description Logic (BDL) BEL is a probabilistic DL, which extends the lightweight DL EL by defining a joint probability distribution over EL axioms with the help of a Bayesian network (BN). In the recent work, extensions of standard logical reasoning tasks in BEL are shown to be reducible to inferences in BNs. This work concentrates on a more general reasoning task, namely on conjunctive query answering in BEL where every query is associated to a probability leading to different reasoning problems. In particular, we study the probabilistic query entailment, top-k answers, and top-k contexts as reasoning problems. Our complexity analysis suggests that all of these problems are tractable under certain assumptions. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{C2015,
author = {{\.{I}}smail {\.{I}}lkan Ceylan},
title = {Query Answering in Bayesian Description Logics},
editor = {Diego Calvanese and Boris Konev},
booktitle = {Proceedings of the 28th International Workshop on Description
Logics (DL 2015)},
volume = {1350},
publisher = {CEUR Workshop Proceedings},
year = {2015}
}
