TY  - RPRT
T1  - How to win a game with features 
T3  - Kaiserslautern ; Saarbrücken : DFKI, 1994
A1  - Backofen,Rolf
A1  - Treinen,Ralf
Y1  - 2011/06/29
N2  - We show, that the axiomatization of rational trees in the language of features given elsewhere is complete. In contrast to other completeness proofs that have been given in this field, we employ the method of Ehrenfeucht-Fraïssé Games, which yields a much simpler proof. The result extends previous results on complete axiomatizations of rational trees in the language of constructor equations or in a weaker feature language. 
KW  - Künstliche Intelligenz
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/3725
ER  -