Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata

14 pages•Published: September 17, 2018

Franz Baader, Oliver Fernandez Gil and Maximilian Pensel

Abstract

Although being quite inexpressive, the description logic (DL) FL0, which provides only conjunction, value restriction and the top concept as concept constructors, has an intractable subsumption problem in the presence of terminologies (TBoxes): subsumption reasoning w.r.t. acyclic FL0 TBoxes is coNP-complete, and becomes even ExpTimecomplete in case general TBoxes are used. In the present paper, we use automata working on infinite trees to solve both standard and non-standard inferences in FL0 w.r.t. general TBoxes. First, we give an alternative proof of the ExpTime upper bound for subsumption in FL0 w.r.t. general TBoxes based on the use of looping tree automata. Second, we em- ploy parity tree automata to tackle non-standard inference problems such as computing the least common subsumer and the difference of FL0 concepts w.r.t. general TBoxes.

Keyphrases: description logic, difference, fl0, least common subsumer, subsumption, tree automata

In: Daniel Lee, Alexander Steen and Toby Walsh (editors). GCAI-2018. 4th Global Conference on Artificial Intelligence, vol 55, pages 1-14.

Links:	https://easychair.org/publications/paper/H6d9
	https://doi.org/10.29007/scbw

BibTeX entry

@inproceedings{GCAI-2018:Standard_Non_Standard_Inferences,
  author    = {Franz Baader and Oliver Fernandez Gil and Maximilian Pensel},
  title     = {Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata},
  booktitle = {GCAI-2018. 4th Global Conference on Artificial Intelligence},
  editor    = {Daniel Lee and Alexander Steen and Toby Walsh},
  series    = {EPiC Series in Computing},
  volume    = {55},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/H6d9},
  doi       = {10.29007/scbw},
  pages     = {1-14},
  year      = {2018}}

Download PDF Open PDF in browser