Author:
Anantharaman Siva,Hibbs Peter,Narendran Paliath,Rusinowitch Michael
Publisher
Springer International Publishing
Reference26 articles.
1. Anantharaman, S., Hibbs, P., Narendran, P., Rusinowitch, M.: Unification of lists with reverse as solving simple sets of word equations. Research-Report.
https://hal.archives-ouvertes.fr/hal-02123648
2. Lecture Notes in Computer Science;PA Abdulla,2014
3. Armando, A., Bonacina, M.P., Ranise, S., Schulz, S.: New results on rewrite-based satisfiability procedures. ACM Trans. Comput. Log. 10(1), 4:1–4:51 (2009)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1999)
5. Baader, F., Schulz, K.U.: Unification in the union of disjoint equational theories: combining decision procedures. J. Symb. Comput. 21(2), 211–243 (1996)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献