LATPub249: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
(2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Carsten | ||
|ErsterAutorNachname=Lutz | |ErsterAutorNachname=Lutz | ||
|FurtherAuthors= | |FurtherAuthors= | ||
Zeile 6: | Zeile 6: | ||
{{Inproceedings | {{Inproceedings | ||
|Referiert=1 | |Referiert=1 | ||
|Title=Description Logics with Concrete | |Title=Description Logics with Concrete Domains—A Survey | ||
|Year=2003 | |Year=2003 | ||
|Month= | |Month= | ||
Zeile 14: | Zeile 14: | ||
|Organization= | |Organization= | ||
|Pages= | |Pages= | ||
|Publisher=World Scientific Publishing Co. | |Publisher=World Scientific Publishing Co. Pte. Ltd. | ||
|Series= | |Series= | ||
|Volume= | |Volume= | ||
Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract= | |Abstract= Description logics (DLs) are a family of logical formalisms that have initially been designed for the representation of conceptual knowledge in artificial intelligence and are closely related to modal logics. In the last two decades, DLs have been successfully applied in a wide range of interesting application areas. In most of these applications, it is important to equip DLs with expressive means that allow to describe ``concrete qualities'' of real-world objects such as their weight, temperature, and spatial extension. The standard approach is to augment description logics with so-called concrete domains, which consist of a set (say, the rational numbers), and a set of n-ary predicates with a fixed extension over this set. The ``interface'' between the DL and the concrete domain is then provided by a new logical constructor that has, to the best of our knowledge, no counterpart in modal logics. In this paper, we give an overview over description logics with concrete domains and summarize decidability and complexity results from the literature. | ||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
Zeile 53: | Zeile 36: | ||
year = {2003}, | year = {2003}, | ||
} | } | ||
}} | }} |
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Description Logics with Concrete Domains—A Survey
Carsten LutzCarsten Lutz
Carsten Lutz
Description Logics with Concrete Domains—A Survey
Advances in Modal Logics Volume 4, 2003. World Scientific Publishing Co. Pte. Ltd.
Description Logics with Concrete Domains—A Survey
Advances in Modal Logics Volume 4, 2003. World Scientific Publishing Co. Pte. Ltd.
- KurzfassungAbstract
Description logics (DLs) are a family of logical formalisms that have initially been designed for the representation of conceptual knowledge in artificial intelligence and are closely related to modal logics. In the last two decades, DLs have been successfully applied in a wide range of interesting application areas. In most of these applications, it is important to equip DLs with expressive means that allow to describe ``concrete qualities of real-world objects such as their weight, temperature, and spatial extension. The standard approach is to augment description logics with so-called concrete domains, which consist of a set (say, the rational numbers), and a set of n-ary predicates with a fixed extension over this set. The ``interface between the DL and the concrete domain is then provided by a new logical constructor that has, to the best of our knowledge, no counterpart in modal logics. In this paper, we give an overview over description logics with concrete domains and summarize decidability and complexity results from the literature. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Lutz-AiML4,
author = {C. {Lutz}},
booktitle = {Advances in Modal Logics Volume 4},
publisher = {World Scientific Publishing Co.\ Pte.\ Ltd.},
title = {Description Logics with Concrete Domains---A Survey},
year = {2003},
}