Author:
Neubauer Matthias,Thiemann Peter
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Aiken, A., Wimmers, E.L.: Solving systems of set constraints. In: Proc. 1992 IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (1992)
2. Alur, R., Dill, D.L.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
3. Lecture Notes in Computer Science;K.R. Apt,2005
4. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, New York (1999)
5. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch.8, vol. I, pp. 445–534. Elsevier Science, Amsterdam (2001)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献