NobleBlocks
Public

Complexity

Published in Cambridge University Press eBooks • Apr 7, 2017
Authors:
Franz Baader
,
Ian Horrocks
,
Carsten Lutz

Abstract

In Chapter 4, we looked at concrete algorithms for reasoning in ALC and some of its extensions. In this chapter, we are taking a more abstract viewpoint and discuss the computational complexity of reasoning, which essentially is the question of how efficient we can expect any reasoning algorithm for...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!