Publication details

Saarland University Computer Science

How to Win a Game with Features

Rolf Backofen, Ralf Treinen

1st International Conference on Constraints in Computational Logics, Vol. 845 of Lecture Notes in Computer Science, vol. 845, pp. 320--335, Springer-Verlag, September 1994

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.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy