The Complexity of Concept Languages (1991)
| Venue: | Information and Computation |
| Citations: | 219 - 33 self |
BibTeX
@INPROCEEDINGS{Donini91thecomplexity,
author = {Francesco M. Donini and Maurizio Lenzerini and Daniele Nardi and Werner Nutt},
title = {The Complexity of Concept Languages},
booktitle = {Information and Computation},
year = {1991},
pages = {151--162},
publisher = {Morgan Kaufmann}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A basic feature of Terminological Knowledge Representation Systems is to represent knowledge by means of taxonomies, here called terminologies, and to provide a specialized reasoning engine to do inferences on these structures. The taxonomy is built through a representation language called a concept language (or description logic), which is given a well-defined set-theoretic semantics. The efficiency of reasoning has often been advocated as a primary motivation for the use of such systems. The main contributions of the paper are: (1) a complexity analysis of concept satisfiability and subsumption for a wide class of concept languages; (2) the algorithms for these inferences that comply with the worst-case complexity of the reasoning task they perform. This is an extended and revised version of a paper presented at the 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning, Cambridge, MA, 1991. 1 Introduction Among computer systems based on Artificial Intelligence ...
