Tractable and Decidable Fragments of Conceptual Graphs (1999)
| Venue: | IN PROCEEDINGS OF ICCS'99 |
| Citations: | 13 - 0 self |
BibTeX
@INPROCEEDINGS{Baader99tractableand,
author = {Franz Baader and Ralf Molitor and Stephan Tobies},
title = {Tractable and Decidable Fragments of Conceptual Graphs},
booktitle = {IN PROCEEDINGS OF ICCS'99},
year = {1999},
pages = {480--493},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is well-known that problems like validity and subsumption of general CGs are undecidable, whereas subsumption is NP-complete for simple conceptual graphs (SGs) and tractable for SGs that are trees. We will employ results on decidable fragments of rst-order logic to identify a natural and expressive fragment of CGs for which validity and subsumption is decidable in ExpTime. In addition, we will extend existing work on the connection between SGs and description logics (DLs) by identifying a DL that corresponds to the class of SGs that are trees. This yields a tractability result previously unknown in the DL community.
