×

zbMATH — the first resource for mathematics

The complexity of existential quantification in concept languages. (English) Zbl 1193.68241
Summary: Much of the research on concept languages, which also are called terminological languages, has focused on the computational complexity of subsumption. The intractability results can be divided into two groups. First, it has been shown that extending the basic language \(\mathcal F\mathcal L^-\) with constructs containing some form of logical disjunction leads to co-NP-hard subsumption problems. Secondly, adding negation to \(\mathcal F\mathcal L^-\) makes subsumption PSPACE-complete.
The main result of this paper is that extending \(\mathcal F\mathcal L^-\) with unrestricted existential quantification makes subsumption NP-complete. This is the proof of intractability for a concept language containing, whether explicitly or implicitly, no construct expressing disjunction. Unrestricted existential quantification is, therefore, alongside disjunction, a source of computational complexity in concept languages.

MSC:
68T30 Knowledge representation
68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q25 Analysis of algorithms and problem complexity
68T27 Logic in artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Brachman, R.J.; Levesque, H.J., The tractability of subsumption in frame based description languages, ()
[2] Brachman, R.J.; Schmolze, J., An overview of the KL-ONE knowledge representation system, Cogn. sci., 9, 2, 171-216, (1985)
[3] Donini, F.M.; Lenzerini, M.; Nardi, Daniele; Nutt, W., The complexity of concept languages, () · Zbl 0765.68187
[4] Garey, M.R.; Johnson, D.S., Computers and intractability—A guide to the theory of NP-completeness, (1979), Freeman San Francisco, CA · Zbl 0411.68039
[5] Hollunder, B.; Nutt, W.; Schmidt-Schauß, M., Subsumption algorithms for concept description languages, ()
[6] Levesque, H.J.; Brachman, R.J., Expressiveness and tractability in knowledge representation and reasoning, Comput. intell., 3, 78-93, (1987)
[7] Nebel, B., Computational complexity of terminological reasoning in BACK, Artif. intell., 34, 3, 371-383, (1988) · Zbl 0646.68110
[8] Nebel, B., Terminological reasoning is inherently intractable, Artif. intell., 43, 2, 235-249, (1990) · Zbl 0717.68089
[9] Nebel, B., Reasoning and revision in hybrid representation systems, (), 422
[10] Nebel, B.; Smolka, G., Representation and reasoning with attributive descriptions, (), 418 · Zbl 0747.68075
[11] Patel-Schneider, P.F., Small can be beautiful in knowledge representation, ()
[12] Schmidt-Schauß, M.; Smolka, G., Attributive concept descriptions with unions and complements, () · Zbl 0712.68095
[13] Schmidt-Schauß, M.; Smolka, G., Attributive concept descriptions with complements, Artif. intell., 48, 1, 1-26, (1991) · Zbl 0712.68095
[14] Smullyan, R.M., First-order logic, (1968), Springer Berlin · Zbl 0172.28901
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.