Publisher
Springer International Publishing
Reference22 articles.
1. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Logic Comput. 4(3), 217–247 (1994)
2. Bachmair, L., Ganzinger, H., McAllester, D.A., Lynch, C.: Resolution theorem proving. In: Handbook of Automated Reasoning, pp. 19–99 (2001)
3. Lecture Notes in Computer Science;C Barrett,2011
4. Barrett, C., Fontaine, P., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2016).
www.SMT-LIB.org
5. Barthe, G., Eilers, R., Georgiou, P., Gleiss, B., Kovács, L., Maffei, M.: Verifying relational properties using trace logic. In: Proceedings of FMCAD, pp. 170–178 (2019)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. An Empirical Assessment of Progress in Automated Theorem Proving;Lecture Notes in Computer Science;2024
2. Reducibility Constraints in Superposition;Lecture Notes in Computer Science;2024
3. SCL(EQ): SCL for First-Order Logic with Equality;Journal of Automated Reasoning;2023-06-30
4. Unifying Splitting;Journal of Automated Reasoning;2023-04-28
5. SAT-Based Subsumption Resolution;Automated Deduction – CADE 29;2023