Author:
Hofbauer Dieter,Huber Maria
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference53 articles.
1. Un théorème de duplication pour les forêts algébrique;Arnold;J. Comput. System Sci.,1976
2. Bachmair, L.1988, Proof by consistency in equational theories, inProc. Logic in Computer Science LICS-88, pp. 228–233, IEEE Comput. Soc. Los Alamitos, CA.
3. Balcázar, J. L, Dı́az, J, and, Gabarró, J. 1988, Structural Complexity, Vol I, Springer-Verlag, Berlin.
4. Bogaert, B., and Tison, S.1992, Equality and disequality constraints on direct subterms in tree automata, inProc. Theoretical Aspects of Computer Science STACS-92A. Finkel and M. Jantzen, Eds., Lecture Notes in Computer Science, Vol. 577, pp. 161–172, Springer-Verlag, Berlin.
5. Automated theorem proving by test set induction;Bouhoula;J. Symbolic Comput.,1997