Reference : Leo-III
Computer developments : Software
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/40372
Leo-III
English
Steen, Alexander mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Wisniewski, Max []
Benzmüller, Christoph mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2016
Deutsche Forschungsgemeinschaft
Leo-III
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/40372
http://page.mi.fu-berlin.de/lex/leo3/
https://github.com/leoprover/Leo-III
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.

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.