The Bayesian Description Logic BEL

Aus International Center for Computational Logic
Version vom 19. März 2015, 18:44 Uhr von Marcel Lippmann (Diskussion | Beiträge)
(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu:Navigation, Suche

Toggle side column
Ismail Ilkan 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{ CePe-IJCAR14,
  author = {Ismail Ilkan {Ceylan} and Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR 2014)},
  editor = {Stephane {Demri} and Deepak {Kapur} and Christoph {Weidenbach}},
  pages = {480--494},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {The Bayesian Description Logic BEL},
  volume = {8562},
  year = {2014},
}