Author:
Reger Giles,Suda Martin,Voronkov Andrei
Publisher
Springer International Publishing
Reference34 articles.
1. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);B Akbarpour,2007
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);E Althaus,2009
3. Bachmair, L., Ganzinger, H., Waldmann, U.: Refutational theorem proving for hierarchic first-order theories. Appl. Algebra Eng. Commun. Comput. 5, 193–212 (1994)
4. Lecture Notes in Computer Science;C Barrett,2011
5. Barrett, C., Stump, A., Tinelli, C.: The Satisfiability Modulo Theories Library (SMT-LIB) (2010).
www.SMT-LIB.org
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Reducibility Constraints in Superposition;Lecture Notes in Computer Science;2024
2. A Higher-Order Vampire (Short Paper);Lecture Notes in Computer Science;2024
3. Program Synthesis in Saturation;Automated Deduction – CADE 29;2023
4. Superposition with Delayed Unification;Automated Deduction – CADE 29;2023
5. ALASCA: Reasoning in Quantified Linear Arithmetic;Tools and Algorithms for the Construction and Analysis of Systems;2023