Author:
Schmidt Renate A.,Hustadt Ullrich
Publisher
Springer Berlin Heidelberg
Reference85 articles.
1. Andréka, H., Németi, I., van Benthem, J.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27(3), 217–274 (1998)
2. Areces, C., Gennari, R., Heguiabehere, J., de Rijke, M.: Tree-based heuristics in modal theorem proving. In: Horn, W. (ed.) Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI 2000), pp. 199–203. IOS Press, Amsterdam (2000)
3. Auffray, Y., Enjalbert, P.: Modal theorem proving: An equational viewpoint. Journal of Logic and Computation 2(3), 247–297 (1992)
4. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. Journal of Logic and Computation 4(3), 217–247 (1994)
5. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, ch. 2, pp. 19–99. Elsevier, Amsterdam (2001)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献