Abstract
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.
Supported by the Bundesminister für Forschung und Technologie (VERBMOBIL)
Supported by the Bundesminister für Forschung und Technologie (Hydra, ITW 9105), the Esprit Working Group CCL (contract EP 6028), and the Esprit Basic Research Project ACCLAIM (contract EP 7195).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hassan Aït-Kaci, Andreas Podelski, and Gert Smolka. A feature-based constraint system for logic programming with entailment. Theoretical Computer Science, 122(1–2):263–283, January 1994.
Rolf Backofen. A complete axiomatization of the algebra of feature trees with arity predicates. To appear as a DFKI-report, 1994.
Rolf Backofen and Gert Smolka. A complete and recursive feature theory. Research Report RR-92-30, Deutsches Forschungszentrum für Künstliche Intelligenz, Stuhlsatzenhausweg 3, D 66123 Saarbrücken, Germany, September 1992. Short version as [4].
Rolf Backofen and Gert Smolka. A complete and recursive feature theory. In Proc. of the 31 th Annual Meeting of the Association for Computational Linguistics, pages 193–200, Columbus, Ohio, 22–26 June 1993. Complete version as [3].
Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7(3,4):371–425, 1989.
Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B — Formal Models and Semantics, chapter 6, pages 243–320. Elsevier Science Publishers and The MIT Press, 1990.
Andrzej Ehrenfeucht. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae, 49:129–141, 1961.
Roland Fraïssé. Sur les classifications des systems de relations. Publications Sci. de l'Université d'Alger, 1:35–182, June 1954.
W. Thomas H.D. Ebbinghaus, J. Flum. Mathematical Logic. Springer-Verlag, 1984.
Wilfrid Hodges. Model Theory. Encyclopedia of Mathematics and its Applications 42. Cambridge University Press, 1993.
Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the Third Annual Symposium on Logic in Computer Science, pages 348–357. IEEE Computer Society, 1988.
Gert Smolka. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51–87, 1992.
Gert Smolka and Ralf Treinen. Records for logic programming. Journal of Logic Programming, 18(3):229–258, April 1994.
Ralf Treinen. Feature constraints with first-class features. In Andrzej M. Borzyszkowski and Stefan Sokołowski, editors, Mathematical Foundations of Computer Science 1993, Lecture Notes in Computer Science, vol. 711, pages 734–743. Springer-Verlag, 30 August–3 September 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Backofen, R., Treinen, R. (1994). How to win a game with features. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016863
Download citation
DOI: https://doi.org/10.1007/BFb0016863
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive