Reasoning With Weighted Ontologies

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

Reasoning With Weighted Ontologies

Rafael PeñalozaRafael Peñaloza
Rafael Peñaloza
Reasoning With Weighted Ontologies
In Bernardo Cuenca {Grau} and Ian {Horrocks} and Boris {Motik} and Ulrike {Sattler}, eds., Proceedings of the 2009 International Workshop on Description Logics ({DL2009}), volume 477 of CEUR-WS, 2009
  • KurzfassungAbstract
    We study the problem of reasoning over weighted ontologies. We assume that

    every axiom is labeled with an element of a distributive lattice (called its weight) and try to compute its so-called boundary, with respect to a given property. We show that axiom pinpointing is the most general instance of this problem. Finally, we present three applications of the problem of

    boundary computation.
  • Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Pena-DL09,
  author = {Rafael {Pe{\~n}aloza}},
  booktitle = {Proceedings of the 2009 International Workshop on Description Logics ({DL2009})},
  editor = {Bernardo Cuenca {Grau} and Ian {Horrocks} and Boris {Motik} and Ulrike {Sattler}},
  series = {CEUR-WS},
  title = {Reasoning With Weighted Ontologies},
  volume = {477},
  year = {2009},
}