Author:
de Moura Leonardo,Bjørner Nikolaj
Subject
General Computer Science,Theoretical Computer Science
Reference18 articles.
1. Ackermann, W., Solvable cases of the decision problem, Studies in Logic and the Foundation of Mathematics (1954)
2. CVC3;Barrett,2007
3. Efficient theory combination via boolean search;Bozzano;Inf. Comput.,2006
4. The MathSAT 3 System;Bozzano,2005
5. Bruttomesso, R., A. Cimatti, A. Franzén, A. Griggio, A. Santuari and R. Sebastiani, To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in UF(E), in: LPAR, 2006, pp. 557–571
Cited by
28 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献