| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 19, Number 3, 2010>>> |
 Magyarul
|
A Resolution Based Description Logic Calculus
Abstract (in LaTeX format)
We present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHQ language. Unlike existing resolution based approaches, the DL calculus is defined directly on DL expressions. We argue that working on this high level of abstraction provides an easier to grasp algorithm with less intermediary transformation steps and increased efficiency. We give a proof of the completeness of our algorithm that relies solely on the ALCHQ tableau method, without requiring any further background knowledge.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@article{Zombori:2010:ActaCybernetica,author = {Zsolt Zombori},
title = {A Resolution Based Description Logic Calculus},
journal = {Acta Cybernetica},
volume = {19},
number= {3},
pages = {571--588},
year = {2010},
abstract = {We present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHQ language. Unlike existing resolution based approaches, the DL calculus is defined directly on DL expressions. We argue that working on this high level of abstraction provides an easier to grasp algorithm with less intermediary transformation steps and increased efficiency. We give a proof of the completeness of our algorithm that relies solely on the ALCHQ tableau method, without requiring any further background knowledge.},
keywords = {}
}