1. Critical pair criteria for completion;Bachmair;Journal of Symbolic Computation,1988
2. J. Blanchette, P. Fontaine, S. Schulz and U. Waldmann, Towards strong higher-order automation for fast interactive verification, in: Proceedings of the 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, G. Reger and D. Trayfel, eds, EPiC Series in Computing, Vol. 51, EasyChair Publications, 2017, pp. 16–23.
3. K. Claessen and N. Smallbone, Efficient encodings of first-order Horn formulas in equational logic, in: Proceedings of the 9th International Joint Conference on Automated Reasoning, D. Galmiche, S. Schulz and R. Sebastiani, eds, Lecture Notes in Computer Science, Vol. 10900, 2018, pp. 388–404.
4. K. Hoder, G. Reger, M. Suda and A. Voronkov, Selecting the selection, in: Proceedings of the 8th International Joint Conference on Automated Reasoning, N. Olivetti and A. Tiwari, eds, Lecture Notes in Artificial Intelligence, Vol. 9706, 2016, pp. 313–329.
5. B. Kiesl, M. Suda, M. Seidl, H. Tompits and A. Biere, Blocked clauses in first-order logic, in: Proceedings of the 21st International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, T. Eiter and D. Sands, eds, EPiC Series in Computing, Vol. 46, EasyChair Publications, 2017, pp. 31–48.