Fixed-Domain Reasoning for Description Logics

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column
Fixed-Domain Reasoning for Description Logics


Sarah Alice Gaggl, Sebastian Rudolph, Lukas Schweizer
Fixed-Domain Reasoning for Description Logics
In Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hüllermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen, eds., Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016), volume 285 of Frontiers in Artificial Intelligence and Applications, 819 - 827, September 2016. IOS Press
  • KurzfassungAbstract
    After decades of fruitful research, description logics

    (DLs) have evolved into a de facto standard in logic-based knowledge representation. In particular, they serve as the formal basis of the standardized and very popular web ontology language (OWL), which also comes with the advantage of readily available user-friendly modeling tools and optimized reasoning engines. In the course of the wide-spread adoption of OWL and DLs, situations have been observed where logically less skilled practitioners are (ab)using these formalisms as constraint languages adopting a closed-world assumption, contrary to the open-world semantics imposed by the classical definitions and the standards. To provide a clear theoretical basis and inferencing support for this often practically reasonable “off-label use” we propose an alternative formal semantics reflecting the intuitive understanding of such scenarios. To that end, we introduce the fixed-domain semantics and argue that this semantics gives rise to an interesting new inferencing task: model enumeration. We describe how the new semantics can be axiomatized in very expressive DLs. We thoroughly investigate the complexities for standard reasoning as well as query answering under the fixed-domain semantics for a wide range of DLs. Further, we present an implementation of a fixed-domain DL reasoner based on a translation into answer set programming (ASP) which is competitive with alternative approaches for standard reasoning tasks and provides the added functionality

    of model enumeration.
  • Projekt:Project: QuantLA
  • Verknüpfte Tools:Related Tools: Wolpertinger
  • Forschungsgruppe:Research Group: Computational Logic
@inproceedings{GRS2016,
  author    = {Sarah Alice Gaggl and Sebastian Rudolph and Lukas Schweizer},
  title     = {Fixed-Domain Reasoning for Description Logics},
  editor    = {Gal A. Kaminka and Maria Fox and Paolo Bouquet and Eyke
               H{\"{u}}llermeier and Virginia Dignum and Frank Dignum and Frank
               van Harmelen},
  booktitle = {Proceedings of the 22nd European Conference on Artificial
               Intelligence (ECAI 2016)},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {285},
  publisher = {IOS Press},
  year      = {2016},
  month     = {September},
  pages     = {819 - 827}
}