Leo-III

Reference : Leo-III


	Document type :	Computer developments : Software
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/40372

Title :	Leo-III
Language :	English
Author, co-author :	Steen, Alexander [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
	Wisniewski, Max []
	Benzmüller, Christoph [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Publication date :	2016
Funders :	Deutsche Forschungsgemeinschaft
Name of the research project :	Leo-III
Target :	Researchers ; Professionals ; Students
Permalink :	http://hdl.handle.net/10993/40372
Other URL :	http://page.mi.fu-berlin.de/lex/leo3/
	https://github.com/leoprover/Leo-III
Technical description :	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.

All documents in ORBi^lu are protected by a user license.