Author:
Godoy Guillem,Tiwari Ashish
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. of Logic and Computation 4, 217–247 (1994)
2. Lecture Notes in Computer Science;A. Bouajjani,2001
3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on
http://www.grappa.univ-lille3.fr/tata
4. Comon, H., Haberstrau, M., Jouannaud, J.-P.: Syntacticness, cyclesyntacticness, and shallow theories. Information and Computation 111(1), 154–191 (1994)
5. Formal Models and Semantics;N. Dershowitz,1990
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献