Disjunction in Modal Description Logics
Publications de l'Institut Mathématique, _N_S_82 (2007) no. 96, p. 25
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
We investigate the complexity of
satisfaction problems in modal description logics without
disjunction between formulae. It is shown that simulation of
disjunction in the class of all models of these logics is
possible, so that the complexity remains same no matter the logics
is with or without disjunction of formulae. However, the omission
of disjunction, in the class of the models based on the universal
relation, ``turns down" the complexity of satisfaction problem
i.e., if P $\neq$ NP, it is not possible to simulate disjunction.
@article{10_2298_PIM0796025M,
author = {Milenko Mosurovi\'c},
title = {Disjunction in {Modal} {Description} {Logics}},
journal = {Publications de l'Institut Math\'ematique},
pages = {25 },
year = {2007},
volume = {_N_S_82},
number = {96},
doi = {10.2298/PIM0796025M},
zbl = {1164.03006},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/PIM0796025M/}
}
Milenko Mosurović. Disjunction in Modal Description Logics. Publications de l'Institut Mathématique, _N_S_82 (2007) no. 96, p. 25 . doi: 10.2298/PIM0796025M
Cité par Sources :