SciDok

Eingang zum Volltext in SciDok

Lizenz

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-37463
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3746/


The complexity of concept languages

Donini, Francesco M. ; Lenzerini, Maurizio ; Nardi, Daniele ; Nutt, Werner

Quelle: (1995) Kaiserslautern ; Saarbrücken : DFKI, 1995
pdf-Format:
Dokument 1.pdf (504 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
SWD-Schlagwörter: Künstliche Intelligenz
Institut: DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer: 95-07
Sprache: Englisch
Erstellungsjahr: 1995
Publikationsdatum: 30.06.2011
Kurzfassung auf Englisch: The basic feature of Terminological Knowledge Representation Systems is to represent knowledge by means of taxonomies, here called terminologies , and to provide a specialized reasoning engine to do inferences on these structures. The taxonomy is built through a representation language called concept language (or description logic), which is given well-defined set-theoretic semantics. The efficiency of reasoning has often been advocated as a primary motivation for the use of such systems. Deduction methods and computational properties of reasoning problems in concept languages are the subject of this paper. The main contributions of the paper are: (1) a complexity analysis of concept satisfiability and subsumption for a wide class of concept languages; (2) the algorithms for these inferences that comply with the worst-case complexity of the reasoning task they perform.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English