{Bayesian Description Logics}

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
{Bayesian Description Logics}
In Meghyn {Bienvenu} and Magdalena {Ortiz} and Riccardo {Rosati} and Mantas {Simkus}, eds., Proceedings of the 27th International Workshop on Description Logics (DL'14), volume 1193 of CEUR Workshop Proceedings, 447--458, 2014. CEUR-WS
  • KurzfassungAbstract
    We present Bayesian Description Logics (BDLs): an extension of Description Logics (DLs) with contextual probabilities

    encoded in a Bayesian network (BN). Classical DL reasoning tasks are extended to consider also the contextual and probabilistic information in BDLs. A complexity analysis of these problems shows that, for propositionally closed DLs, this extension comes without cost, while for tractable DLs the complexity is

    affected by the cost of reasoning in the BN.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ CePe-DL14,
  author = {Ismail Ilkan {Ceylan} and Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 27th International Workshop on Description Logics (DL'14)},
  editor = {Meghyn {Bienvenu} and Magdalena {Ortiz} and Riccardo {Rosati} and Mantas {Simkus}},
  pages = {447--458},
  publisher = {CEUR-WS},
  series = {CEUR Workshop Proceedings},
  title = {{Bayesian Description Logics}},
  volume = {1193},
  year = {2014},
}