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.
| Original language | English |
|---|---|
| Pages (from-to) | 367-377 |
| Number of pages | 11 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 9195 |
| DOIs | |
| Publication status | Published - 2015 |
| Event | 25th International Conference on Automated Deduction CADE 2015 - Berlin, Germany Duration: 1 Aug 2015 → 7 Aug 2015 |
Fingerprint
Dive into the research topics of 'Beagle – A hierarchic superposition theorem prover'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver