You can manage bookmarks using lists, please log in to your user account for this.
Media type:
E-Article
Title:
Expressiveness and tractability in knowledge representation and reasoning1
Contributor:
Levesque, Hector J.;
Brachman, Ronald J.
Published:
Wiley, 1987
Published in:
Computational Intelligence, 3 (1987) 1, Seite 78-93
Language:
English
DOI:
10.1111/j.1467-8640.1987.tb00176.x
ISSN:
0824-7935;
1467-8640
Origination:
Footnote:
Description:
A fundamental computational limit on automated reasoning and its effect on knowledge representation is examined. Basically, the problem is that it can be more difficult to reason correctly with one representational language than with another and, moreover, that this difficulty increases dramatically as the expressive power of the language increases. This leads to a tradeoff between the expressiveness of a representational language and its computational tractability. Here we show that this tradeoff can be seen to underlie the differences among a number of existing representational formalisms, in addition to motivating many of the current research issues in knowledge representation.