%0 Book %1 nardi03 %A Nardi, Daniele %A Brachman, Ronald J. %B The Description Logic Handbook: Theory, imple %C Cambridge UK %D 2003 %I Cambridge University Press %K logic description %P 1--574 %T An Introduction to Description Logics %U http://www.cs.toronto.edu/~nernst/papers/reasoning-ai-logic\dlhb-01.pdf %X This introduction presents the main motivations for the development of Description Logics (DL) as a formalism for representing knowledge, as well as some important basic notions underlying all systems that have been created in the DL tradition. In addition, we provide the reader with an overview of the entire book and some guidelines for reading it. We first address the relationship between Description Logics and earlier seman- tic network and frame systems, which represent the original heritage of the field. We delve into some of the key problems encountered with the older e.orts. Subse- quently, we introduce the basic features of Description Logic languages and related reasoning techniques. Description Logic languages are then viewed as the core of knowledge represen- tation systems, considering both the structure of a DL knowledge base and its associated reasoning services. The development of some implemented knowledge representation systems based on Description Logics and the first applications built with such systems are then reviewed. Finally, we address the relationship of Description Logics to other fields of Com- puter Science. We also discuss some extensions of the basic representation language machinery; these include features proposed for incorporation in the formalism that originally arose in implemented systems, and features proposed to cope with the needs of certain application domains. %7 2

@book{nardi03, abstract = {This introduction presents the main motivations for the development of Description Logics (DL) as a formalism for representing knowledge, as well as some important basic notions underlying all systems that have been created in the DL tradition. In addition, we provide the reader with an overview of the entire book and some guidelines for reading it. We first address the relationship between Description Logics and earlier seman- tic network and frame systems, which represent the original heritage of the field. We delve into some of the key problems encountered with the older e.orts. Subse- quently, we introduce the basic features of Description Logic languages and related reasoning techniques. Description Logic languages are then viewed as the core of knowledge represen- tation systems, considering both the structure of a DL knowledge base and its associated reasoning services. The development of some implemented knowledge representation systems based on Description Logics and the first applications built with such systems are then reviewed. Finally, we address the relationship of Description Logics to other fields of Com- puter Science. We also discuss some extensions of the basic representation language machinery; these include features proposed for incorporation in the formalism that originally arose in implemented systems, and features proposed to cope with the needs of certain application domains.}, added-at = {2006-03-24T16:34:33.000+0100}, address = {Cambridge UK}, author = {Nardi, Daniele and Brachman, Ronald J.}, biburl = {https://www.bibsonomy.org/bibtex/2cc61da9c3077eb56fc3764179215db80/neilernst}, citeulike-article-id = {121817}, comment = {2nd version, older one is 1994? intelligent = find implicit consequences of explicitly represented knowledge approaches to lots of notes in email to peggy}, description = {sdasda}, edition = 2, interhash = {e2cc7ceb513a60a6a08717dcece20a66}, intrahash = {cc61da9c3077eb56fc3764179215db80}, keywords = {logic description}, pages = {1--574}, priority = {0}, publisher = {Cambridge University Press}, series = {The Description Logic Handbook: Theory, imple}, timestamp = {2006-03-24T16:34:33.000+0100}, title = {An {I}ntroduction to {D}escription {L}ogics}, url = {http://www.cs.toronto.edu/~nernst/papers/reasoning-ai-logic\dlhb-01.pdf}, year = 2003 }