Zoekresultaten
Resultaat 1 - 15 (van 15)
Olga Tveretina | H. Zantema Transforming DPLL to resolution
Non-fictie
Engels | 16 pagina's | TU/e, Technische Universiteit Eindhoven, Department of Mathematics and Computer Science, Eindhoven | 2002
Gedrukt boek
W.J. Fokkink | H. Zantema Termination modulo equations by abstract commutation with an application to iteration
Non-fictie
Engels | 17 pagina's | Department of Philosophy, Utrecht University, Utrecht | 1996
Gedrukt boek
H. Zantema | A. Geser Non-looping rewriting
Non-fictie
Engels | 26 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1996
Gedrukt boek
M.C.F. Ferreira | H. Zantema Syntactical analysis of total termination
Non-fictie
Engels | 20 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
M.C.F. Ferreira | H. Zantema Dummy elimination
making termination easier
Non-fictie
Engels | 18 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
M.C.F. Ferreira | H. Zantema Well-foundedness of term orderings
Non-fictie
Engels | 18 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
V.C.S. Meeussen | H. Zantema Derivation lengths in term rewriting from interpretations in the naturals
Non-fictie
Engels | 13 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
M.C.F. Ferreira | H. Zantema Total termination of term rewriting
Non-fictie
Engels | 24 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1992
Gedrukt boek
H. Zantema Classifying termination of term rewriting
Non-fictie
Engels | 12 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1991
Gedrukt boek
H. Zantema Termination of term rewriting: from many-sorted to one-sorted
Non-fictie
Engels | 14 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1991
Gedrukt boek
H. Zantema Minimizing sums of addition chains
Non-fictie
Engels | 23 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1989
Gedrukt boek
H. Zantema Binary structures in program transformations
Non-fictie
Engels | 25 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
H. Zantema Termination of term rewriting by interpretation
Non-fictie
Engels | 21 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek
H. Zantema Majority voting
characterization and algorithms
Non-fictie
Engels | 13 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
J.F. Groote | H. Zantema Resolution and binary decision diagrams cannot simulate each other polynomially
Non-fictie
Engels | 12 pagina's | Centrum voor Wiskunde en Informatica, Amsterdam | 2000
Gedrukt boek