The Bayesian Description Logic BEL

From International Center for Computational Logic

Toggle side column
İsmail İlkan Ceylan, Rafael Peñaloza
The Bayesian Description Logic BEL
In Stephane Demri and Deepak Kapur and Christoph Weidenbach, eds., Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR 2014), volume 8562 of Lecture Notes in Computer Science, 480-494, 2014. Springer
  • KurzfassungAbstract
    We introduce the probabilistic Description Logic BEL. In BEL, axioms are required to hold only in an associated context. The probabilistic component of the logic is given by a Bayesian network that describes the joint probability distribution of the contexts. We study the main reasoning problems in this logic; in particular, we (i) prove that deciding positive and almost-sure entailments is not harder for BEL than for the BN, and (ii) show how to compute the probability, and the most likely context for a consequence.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
The final publication is available at Springer.
@inproceedings{CP2014,
  author    = {{\.{I}}smail {\.{I}}lkan Ceylan and Rafael Pe{\~{n}}aloza},
  title     = {The Bayesian Description Logic {BEL}},
  editor    = {Stephane Demri and Deepak Kapur and Christoph Weidenbach},
  booktitle = {Proceedings of the 7th International Joint Conference on
               Automated Reasoning (IJCAR 2014)},
  series    = {Lecture Notes in Computer Science},
  volume    = {8562},
  publisher = {Springer},
  year      = {2014},
  pages     = {480-494}
}