Bernhard Nebel  Home/Search
Context Related
| informatik.unifrei...nebelaij90.ps.gz informatik.uniulm...lisintract.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifreibur...journals (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Computational tractability has been a major concern in the area of terminological knowledge representation and reasoning. However, all analyses of the computational complexity of terminological reasoning are based on the hidden assumption that subsumption in terminologies reduces to subsumption of concept descriptions without a significant increase in computational complexity. In this paper it will be shown that this assumption, which seems to work in the "normal case," is nevertheless wrong.... (Update)
Cited by: More
A Description Logic Based Approach to Reasoning about - Web Services Franz (2005) (Correct)
A Uniform Tableaux-Based Approach to Concept.. - Colucci, Di Noia, .. (Correct)
Using Lazy Unfolding for the Computation of Least Common.. - Turhan, Molitor (Correct)
Active bibliography (related documents): More All
1.2: What is Hybrid in Hybrid Representation and Reasoning Systems? - Nebel (1989) (Correct)
0.5: Terminological Cycles: Semantics and Computational Properties - Nebel (1991) (Correct)
0.3: Terminological Reasoning and Information Management - Nebel, Peltason (1991) (Correct)
Similar documents based on text: More All
0.2: Characterizing the Semantics of Terminological Cycles in ALN.. - Küsters (1998) (Correct)
0.1: Characterizing the Semantics of Terminological Cycles With the .. - Küsters (1998) (Correct)
0.1: Terminologies and Terminology Servers for.. - Bechhofer, Goble.. (1997) (Correct)
Related documents from co-citation: More All
50: The complexity of concept languages - Donini, Lenzerini et al. - 1991
47: An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
42: Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991
BibTeX entry: (Update)
Bernhard Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence, 43:235--249, 1990. http://citeseer.ist.psu.edu/nebel90terminological.html More
@article{ nebel90terminological,
author = "Bernhard Nebel",
title = "Terminological Reasoning is Inherently Intractable",
journal = "Artificial Intelligence",
volume = "43",
pages = "235--249",
year = "1990",
url = "citeseer.ist.psu.edu/nebel90terminological.html" }
Citations (may not include all citations):4212 Computers and Intractability---A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
480 An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985 DBLP
231 CLASSIC: a structural data model for objects - Borgida, Brachman et al. - 1989 ACM DBLP
118 The tractability of subsumption in frame-based description l.. (context) - Brachman, Levesque - 1984 DBLP
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987 DBLP
87 An efficient unification algorithm (context) - Martelli, Montanari - 1982 ACM DBLP
82 Journal of Computer and System Sciences (context) - Paterson, Wegman et al. - 1978
74 The Loom knowledge representation language (context) - MacGregor, Bates - 1987
72 Computational complexity of terminological reasoning in BACK - Nebel - 1988 ACM DBLP
69 Subsumption in KL-ONE is undecidable (context) - Schmidt-Schauss - 1989 ACM DBLP
65 An essential hybrid reasoning system: knowledge and symbol l.. (context) - Brachman, Gilbert et al. - 1985
45 Undecidability of subsumption in NIKL (context) - Patel-Schneider - 1989 DBLP
39 Small can be beautiful in knowledge representation (context) - Patel-Schneider - 1984
36 Logic and the complexity of reasoning (context) - Levesque - 1988
30 A four-valued semantics for terminological logics (context) - Patel-Schneider - 1989 ACM DBLP
26 Recent developments in NIKL (context) - Kaczmarek, Bates et al. - 1986 DBLP
24 Technische Universitat Berlin (context) - von Luck, Nebel et al. - 1987
19 A unification method for disjunctive feature descriptions - Kasper - 1987 ACM
15 Polymorphic unification and ML typing (context) - Kanellakis, Mitchell - 1989
15 Data models in knowledge representation systems: a case stud.. (context) - Edelmann, Owsnicki - 1986
15 Technische Universitat Berlin (context) - Schild, of et al. - 1988
12 The CLASSIC knowledge representation system (context) - Brachman, Borgida et al. - 1989 ACM
12 The SB-ONE knowledge representation workbench (context) - Kobsa - 1989
6 Determining consistency of feature terms with distributed di.. (context) - Dorre, Eisele - 1989 ACM DBLP
2 Massachusetts Institute of Technology (context) - Doyle, Patil et al. - 1989
1 To appear (context) - Schmidt-Schauss, Smolka et al. - 1989
1 KRYPTON: description of an implementation (context) - Pigman - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~nebel/journals.html): More
Computational Complexity of Terminological Reasoning in BACK - Nebel (1988) (Correct)
On the Expressivity of Feature Logics with.. - Baader, Bürckert, .. (1993) (Correct)
On the Computational Complexity of Temporal Projection.. - Nebel, Bäckström (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC