Bernhard Nebel  Home/Search
Context Related
| informatik.unifre...llli93book.ps.gz i5.informatik.rwthaache...nebel1.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.unifr...publikationen (more) From: i5.informatik.rwthaachen.de/L... (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Although the computational perspective on cognitive tasks has always played a major role in Artificial Intelligence, the interest in the precise determination of the computational costs that are required for solving typical AI problems has grown only recently. In this paper, we will describe what insights a computational complexity analysis can provide and what methods are available to deal with the complexity problem. This work was partially supported by the European Commission as part of... (Update)
Context of citations to this paper: More
...generality may only be solved for small instances. Many AI problems in their general formulation are at least NP hard problems (Nebel,1995). Experts solve such problems by using a large amount of domain specific knowledge, which allows to restrict the problem, to...
...a purely functional specification. In general, most problems tackled with KBSs are inherently complex and intractable (see e.g. 13] and [14]) A specification has to describe not just a realization of the functionality, but one which takes into account the constraints of the...
Cited by: More
Catalogue Integration - A Case Study in.. - Stuckenschmidt.. (2000) (Correct)
Qualitative Spatio-Temporal Representation and Reasoning.. - Wolter, Zakharyaschev (2001) (Correct)
Specification of Dynamics for Knowledge-based.. - van Eck.. (1998) (Correct)
Similar documents (at the sentence level):
8.2%: How Hard is it to Revise a Belief Base? - Nebel (1996) (Correct)
Active bibliography (related documents): More All
0.7: Equivalence and Tractability Results for SAS+ Planning - Bäckström (1992) (Correct)
0.6: Description Logics in Data Management - Borgida (1995) (Correct)
0.5: Tractable Reasoning via Approximation - Schaerf, Cadoli (1995) (Correct)
Similar documents based on text: More All
0.1: Terminological Cycles: Semantics and Computational Properties - Nebel (1991) (Correct)
0.1: An Empirical Analysis of Optimization Techniques.. - Baader.. (1992) (Correct)
0.1: Default Reasoning and Belief Revision: A Syntax-Independent.. - Zhang, al. (Correct)
Related documents from co-citation: More All
13: The Knowledge Acquisition and Representation Language KARL - Fensel - 1995
8: Dynamic logic - Harel - 1984
8: A Comparison of Languages which Operationalize and Formalise KADS Models of Expe.. - Fensel, Harmelen - 1994
BibTeX entry: (Update)
B. Nebel. Artificial intelligence: A computational perspective. In G. Brewka, editor, Principals of Knowledge Representation, Studies in Logic, Language and Information, pages 237--266. CSLI Publications, 1996. http://citeseer.ist.psu.edu/nebel94artificial.html More
@incollection{ nebel95artificial,
author = "Bernhard Nebel",
title = "Artificial Intelligence: {A} Computational Perspective",
booktitle = "Essentials in Knowledge Representation",
publisher = "Stanford University Center for the Study of Language and Information",
address = "Stanford, CA, USA",
editor = "G. Brewka",
year = "1995",
url = "citeseer.ist.psu.edu/nebel94artificial.html" }
Citations (may not include all citations):4212 Computers and Intractability---A Guide to the Theory of NP-C.. (context) - Garey, Johnson - 1979
1044 Maintaining knowledge about temporal intervals (context) - Allen - 1983 ACM DBLP
891 STRIPS: A new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971 DBLP
480 An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
458 A theory of diagnosis from first principles (context) - Reiter - 1987
451 Planning for conjunctive goals (context) - Chapman - 1987 ACM DBLP
444 Towards a general theory of action and time (context) - Allen - 1984 ACM DBLP
416 A new method for solving hard satisfiability problems - Selman, Levesque et al. - 1992 DBLP
320 Hard and easy distributions of SAT problems - Mitchell, Selman et al. - 1992
284 Constraint propagation algorithms for temporal reasoning: A .. (context) - Vilain, Kautz et al. - 1989
284 Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986 DBLP
274 A catalog of complexity classes (context) - Johnson - 1990 ACM DBLP
207 Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991 ACM DBLP
193 Reasoning and Revision in Hybrid Representation Systems (context) - Nebel - 1990 ACM
176 A correspondence theory for terminological logics: Prelimina.. - Schild - 1991 DBLP
168 Inside Case-Based Reasoning (context) - Riesbeck, Schank - 1989 ACM
161 A logic of implicit and explicit belief (context) - Levesque - 1984 DBLP
161 Complexity results for nonmonotonic logics (context) - Gottlob - 1992 DBLP
150 Computational Complexity (context) - Papadimitriou - 1994
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994 ACM DBLP
118 The tractability of subsumption in frame-based description l.. (context) - Brachman, Levesque - 1984 DBLP
112 Terminological reasoning is inherently intractable - Nebel - 1990
112 Two-level morphology: A general computational model for word.. (context) - Koskenniemi - 1983
107 The Mathematics of Inheritance Systems (context) - Touretzky - 1986 ACM
102 A validation-structure-based theory of plan modification and.. (context) - Kambhampati, Hendler - 1992 ACM DBLP
97 Knowledge compilation using Horn approximations - Selman, Kautz - 1991
96 the semantics of updates in databases (context) - Fagin, Ullman et al. - 1983
96 the complexity of propositional knowledge base revision - Eiter, Gottlob - 1992
94 Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987 DBLP
91 Propositional circumscription and extended closed world reas.. - Eiter, Gottlob - 1993
91 Artificial Intelligence (context) - Ginsberg - 1986
89 Terminological cycles: Semantics and computational propertie.. - Nebel - 1991
88 Two theses of knowledge representation: Language restriction.. - Doyle, Patil - 1991
88 Subsumption algorithms for concept description languages - Hollunder, Nutt et al. - 1990 DBLP
85 Planning using a temporal world model (context) - Allen, Koomen - 1983 DBLP
84 The complexity of logic-based abduction - Eiter, Gottlob - 1993 ACM DBLP
82 Reasoning about partially ordered events (context) - Dean, Boddy - 1988
77 Tractable concept languages (context) - Donini, Lenzerini et al. - 1991 DBLP
76 Making believers out of computers (context) - Levesque - 1986 ACM DBLP
74 A skeptical theory of inheritance in nonmonotonic semantic n.. (context) - Horty, Thomason et al. - 1987 ACM DBLP
73 A clash of intuitions: The current state of nonmonotonic mul.. (context) - Touretzky, Horty et al. - 1987
72 Belief revision and default reasoning: Syntax-based approach.. - Nebel - 1991 DBLP
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
59 Temporal reasoning and planning (context) - Allen - 1991
58 A survey of complexity results for non-monotonic logics - Cadoli, Schaerf - 1993
56 The complexity of existential quantification in concept lang.. - Donini, Lenzerini et al. - 1992 ACM DBLP
51 the complexity of blocks-world planning - Gupta, Nau - 1992
48 Exact and approximate reasoning about temporal relations (context) - van Beek, Cohen - 1990 ACM DBLP
48 The complexity of propositional default logics (context) - Stillman - 1992 DBLP
45 Undecidability of subsumption in NIKL (context) - Patel-Schneider - 1989 DBLP
45 A logical framework for depiction and image interpretation (context) - Reiter, Mackworth - 1989 ACM DBLP
42 An empirical analysis of terminological representation syste.. - Heinsohn, Kudenko et al. - 1994 ACM DBLP
40 A knowledge-based configurator that supports sales - Wright, Weixelbaum et al. - 1993
37 the parallel complexity of discrete relaxation in constraint.. (context) - Kasif - 1990
33 the logic of theory change: Partial meet contraction and rev.. (context) - Alchourr'on, Gardenfors et al. - 1985
32 the computational complexity of temporal projection - Nebel, Backstrom - 1994
31 Where the really hard problems are (context) - Cheeseman, Kanefsky et al. - 1991 DBLP
30 A four-valued semantics for terminological logics (context) - Patel-Schneider - 1989 ACM DBLP
27 Terminological cycles in KL-ONE-based knowledge representati.. (context) - Baader - 1990 DBLP
26 Plan reuse versus plan generation: A theoretical and empiric.. - Nebel, Koehler - 1995
22 The tractability of path-based inheritance (context) - Selman, Levesque - 1989 ACM DBLP
21 propositional logic and constraints (context) - Ben-Eliyahu, Dechter - 1991
21 The interpretation of temporal relations in narrative (context) - Song, Cohen - 1988 DBLP
19 The hardest random sat problems - Gent, Walsh - 1994
16 Base revision operations and schemes: Semantics (context) - Nebel - 1994
12 and Joaquim Gabarr 'o (context) - Balc'azar, Diaz - 1988
10 Tractable meta-reasoning in propositional logics of belief (context) - Lakemeyer - 1987
10 Approximation in concept description languages (context) - Cadoli, Schaerf - 1992 DBLP
9 The complexity of path-based defeasible inheritance (context) - Selman, Levesque - 1993 ACM DBLP
8 Structural Complexity II (context) - Balc'azar, Diaz et al. - 1990
8 A System for Representing and Using Real-World Knowledge (context) - Fahlman - 1979
8 Temporally Distributed Symptoms in Technical Diagnosis (context) - Nokel - 1991
7 Incremental causal reasoning (context) - Dean, Boddy - 1987 DBLP
6 Attributive description formalisms : : : and the rest of the.. - Nebel, Smolka - 1991
5 Tractability and Artificial Intelligence (context) - Bylander - 1991 ACM
5 Optimal approximations and polynomially levelable sets (context) - Orponen, Russo et al. - 1986 ACM DBLP
5 Towards coordinated temporal multimedia presentation (context) - Feiner, Litman et al. - 1993
5 Computational complexity in two-level morphology - Barton - 1986 ACM
5 Approximate entailment (context) - Cadoli, Schaerf - 1991 ACM DBLP
4 Local consistency in parallel constraint networks (context) - Kasif, Delcher - 1994
3 The KL-ONE family (context) - Schmolze, Woods - 1992
3 Automatic building and validation of complex object database.. (context) - Bergamaschi, Nebel - 1994
2 An empirical evaluation of knowledge compilation - Kautz, Selman - 1994
2 Algorithms and complexity for reasoning about time (context) - Golumbic, Shamir - 1992 DBLP
1 two-level morphology and Finish (context) - Koskenniemi, Church - 1988
1 osen ohne Suchen (context) - Enzinger, Puppe et al. - 1994
1 Domain-specific complexity tradeoffs (context) - Selman - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.uni-freiburg.de/~ki/publikationen.html): More
Solving Hard Qualitative Temporal Reasoning Problems: Evaluating.. - Nebel (1997) (Correct)
A Cognitive Assessment of Topological Spatial Relations.. - Knauff, Rauh, Renz (1997) (Correct)
An Experimental Comparison of Localization Methods - Gutmann, Burgard, Fox, Konolige (1998) (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