The Complexity of Existential Quantification in Concept Languages (1992)
by
Francesco M. Donini
,
Bernhard Hollunder
,
Maurizio Lenzerini
,
Alberto Marchetti Spaccamela
,
Daniele Nardi
,
Werner Nutt
| Citations: | 47 - 14 self |
BibTeX
@MISC{Donini92thecomplexity,
author = {Francesco M. Donini and Bernhard Hollunder and Maurizio Lenzerini and Alberto Marchetti Spaccamela and Daniele Nardi and Werner Nutt},
title = {The Complexity of Existential Quantification in Concept Languages},
year = {1992}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper is that subsumption and unsatisfiability in ALE are NP-hard. In fact, subsumption is shown to be NP-hard for the simpler language FLE
Citations
| 543 | An overview of the KL-ONE knowledge representation system. Cognitive Science 171{216 - Brachman, Schmolze - 1985 |
| 219 | The complexity of concept languages - Donini, Lenzerini, et al. - 1997 |
| 192 | Reasoning and Revision in Hybrid Representation Systems - Nebel - 1990 |
| 162 | Computers and Intractability—A Guide to the Theory of NP-Completeness - Garey, Johnson - 1979 |
| 136 | Terminological reasoning is inherently intractable - Nebel - 1990 |
| 111 | Expressiveness and tractability in knowledge representation and reasoning - Levesque, Brachman - 1987 |
| 78 | Subsumption algorithms for concept description languages - Hollunder, Nutt, et al. - 1990 |
| 60 | Computational complexity of terminological reasoning in BACK - Nebel - 1988 |
| 5 | The Tractability of Subsumption in Frame Based Description Languages - Brachman, Levesque - 1984 |
