TY - RPRT
T1 - An alternative to theta-subsumption based on terminological reasoning
T3 - Kaiserslautern ; Saarbrücken : DFKI, 1992
A1 - Hanschke,Philipp
A1 - Meyer,Manfred
Y1 - 2011/07/01
N2 - 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.
KW - Künstliche Intelligenz
CY - Saarbrücken
PB - Saarländische Universitäts- und Landesbibliothek
AD - Postfach 151141, 66041 Saarbrücken
UR - http://scidok.sulb.uni-saarland.de/volltexte/2011/3785
ER -