Eingang zum Volltext in SciDok
Lizenz
Report (Bericht) zugänglich unter
Embedding defaults into terminological knowledge representation formalisms
URN: urn:nbn:de:bsz:291-scidok-36522
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/3652/
Quelle:
(1993) Kaiserslautern ; Saarbrücken : DFKI, 1993
pdf-Format:
Dokument 1.pdf (404 KB)
![]()
![]()
![]()
![]()
![]()
SWD-Schlagwörter:
Künstliche Intelligenz
Institut:
DDC-Sachgruppe:
Informatik
Dokumentart:
Report (Bericht)
Schriftenreihe:
Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Bandnummer:
93-20
Sprache:
Englisch
Erstellungsjahr:
1993
Publikationsdatum:
27.06.2011
Kurzfassung auf Englisch:
We consider the problem of integrating Reiter's default logic into terminological representation systems. It turns out that such an integration is less straightforward than we expected, considering the fact that the terminological language is a decidable sublanguage of first-order logic. Semantically, one has the unpleasant effect that the consequences of a terminological default theory may be rather unintuitive, and may even vary with the syntactic structure of equivalent concept expressions. This is due to the unsatisfactory treatment of open defaults via Skolemization in Reiter's semantics. On the algorithmic side, we show that this treatment may lead to an undecidable default consequence relation, even though our base language is decidable, and we have only finitely many (open) defaults. Because of these problems, we then consider a restricted semantics for open defaults in our terminological default theories: default rules are only applied to individuals that are explicitly present in the knowledge base. In this semantics it is possible to compute all extensions of a finite terminological default theory, which means that this type of default reasoning is decidable.
Lizenz:
Standard-Veröffentlichungsvertrag