Please use this identifier to cite or link to this item: doi:10.22028/D291-24987
Title: An alternative to theta-subsumption based on terminological reasoning
Author(s): Hanschke, Philipp
Meyer, Manfred
Language: English
Year of Publication: 1992
OPUS Source: Kaiserslautern ; Saarbrücken : DFKI, 1992
SWD key words: Künstliche Intelligenz
DDC notations: 004 Computer science, internet
Publikation type: Report
Abstract: Clause subsumption and rule ordering are long-standing research topics in machine learning (ML). Since logical implication can be reduced to rule-subsumption, the general subsumption problem for Horn clauses is undecidable [Plotkin, 1971b]. In this paper we suggest an alternative knowledge-representation formalism for ML that is based on a terminological logic. It provides a decidable rule-ordering which is at least as powerful as Theta-subsumption.
Link to this record: urn:nbn:de:bsz:291-scidok-37853
Series name: Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]
Series volume: 92-38
Date of registration: 1-Jul-2011
Faculty: SE - Sonstige Einrichtungen
Department: SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
RR_92_38.pdf6,1 MBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.