Paper Info
Title
Complexity Results and Practical Algorithms for Logics in Knowledge Representation
Abstract
Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs that provide different forms of counting quantifiers. We show that, in many cases, adding local counting in the form of qualifying number restrictions to DLs does not increase the complexity of the...
Year
Venue
Keywords
2001
Computing Research Repository
knowledge based system,description logic,artificial intelligent,knowledge representation
Field
DocType
Volume
Discrete mathematics,Knowledge representation and reasoning,Semantic reasoner,Clique,Inference,Computer science,Binary code,Algorithm,Description logic,Theoretical computer science,Application domain
Journal
cs.LO/0106031
Citations 
PageRank 
References 
187
14.75
102
Authors
1
Search Limit
100187
Name
Order
Citations
PageRank
Stephan Tobies11599158.86