Author:
Bentkamp Alexander,Blanchette Jasmin Christian,Cruanes Simon,Waldmann Uwe
Publisher
Springer International Publishing
Reference44 articles.
1. Andrews, P.B.: Classical type theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. II, pp. 965–1007. Elsevier and MIT Press (2001)
2. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Log. Comput. 4(3), 217–247 (1994)
3. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);H Becker,2017
4. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);M Beeson,2004
5. Bentkamp, A., Blanchette, J.C., Cruanes, S., Waldmann, U.: Superposition for lambda-free higher-order logic (technical report). Technical report (2018). http://matryoshka.gforge.inria.fr/pubs/lfhosup_report.pdf
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Extending a High-Performance Prover to Higher-Order Logic;Tools and Algorithms for the Construction and Analysis of Systems;2023
2. Larry Wos: Visions of Automated Reasoning;Journal of Automated Reasoning;2022-02-28
3. Making Higher-Order Superposition Work;Journal of Automated Reasoning;2022-01-17
4. Superposition with Lambdas;Journal of Automated Reasoning;2021-08-21
5. Extending a brainiac prover to lambda-free higher-order logic;International Journal on Software Tools for Technology Transfer;2021-08-16