| Reference : Leo-III 1.4 |
| Computer developments : Software | |||
| Engineering, computing & technology : Computer science | |||
| http://hdl.handle.net/10993/42685 | |||
| Leo-III 1.4 | |
| English | |
Steen, Alexander  [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >] | |
| Oct-2019 | |
| 2016 | |
| [en] Leo-III ; Higher-Order Logic ; Automated Reasoning | |
| Researchers ; Professionals ; Students | |
| http://hdl.handle.net/10993/42685 | |
| https://github.com/leoprover/Leo-III/releases/tag/v1.4 | |
| http://page.mi.fu-berlin.de/lex/leo3/ | |
| Leo-III 1.4 won the 2019 international theorem prover championship CASC-27 in Natal, Brazil, in the LTB category. See http://tptp.org/CASC/27/ for details. | |
| Leo-III is an automated theorem prover for (polymorphic) higher-order logic which supports all common TPTP dialects, including THF, TFF and FOF as well as their rank-1 polymorphic derivatives. It is based on a paramodulation calculus with additional ordering constraints and, in tradition of its predecessor LEO-II, heavily relies on cooperation with external (mostly first-order) theorem provers for increased performance. Nevertheless, Leo-III can also be used as a stand-alone prover without employing any external cooperation. | |
| 1.4 |
There is no file associated with this reference.
All documents in ORBilu are protected by a user license.
