Matching in the Description Logic FL0 with respect to General TBoxes

19 pages•Published: October 23, 2018

Franz Baader, Oliver Fernandez Gil and Pavlos Marantidis

Abstract

Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics two decades ago, motivated by applications in the Classic system. Shortly afterwards, a polynomial-time matching algorithm was developed for the DL FL0. However, this algorithm cannot deal with general TBoxes (i.e., finite sets of general concept inclusions). Here we show that matching in FL0 w.r.t. general TBoxes is in ExpTime, which is the best possible complexity for this problem since already subsumption w.r.t. general TBoxes is ExpTime-hard in FL0. We also show that, w.r.t. a restricted form of TBoxes, the complexity of matching in FL0 can be lowered to PSpace.

Keyphrases: complexity, description logic, matching, tree automata

In: Gilles Barthe, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 57, pages 76-94.

Links:	https://easychair.org/publications/paper/XrXz
	https://doi.org/10.29007/q74p

BibTeX entry

@inproceedings{LPAR-22:Matching_Description_Logic_FL0,
  author    = {Franz Baader and Oliver Fernandez Gil and Pavlos Marantidis},
  title     = {Matching in the Description Logic FL0 with respect to General TBoxes},
  booktitle = {LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Gilles Barthe and Geoff Sutcliffe and Margus Veanes},
  series    = {EPiC Series in Computing},
  volume    = {57},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/XrXz},
  doi       = {10.29007/q74p},
  pages     = {76-94},
  year      = {2018}}

Download PDF Open PDF in browser