Abstract
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle’s proof procedure, background reasoning facilities, implementation, and experimental results.
Cite
CITATION STYLE
APA
Baumgartner, P., Bax, J., & Waldmann, U. (2015). Beagle – A hierarchic superposition theorem prover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9195, pp. 367–377). Springer Verlag. https://doi.org/10.1007/978-3-319-21401-6_25
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free