LEO-II
LEO-II is a standalone, resolution-based higher-order theorem prover designed for fruitful cooperation with specialist provers for natural fragments of higher-order logic. At present LEO-II can cooperate with TPTP compliant first-order automated theorem provers such as E, SPASS, Gandalf and Vampire. World Champion 2010: LEO-II was the winner of the THF division (automation of higher-order logic) at CASC-J5. At CASC-J23 in 2011 LEO-II finished second in the THF division. Moreover, at CASC-J5 and CASC-23 LEO-II did also participate in the first-order divisions FOF and CNF and performed reasonably well. LEO-II has been the first theorem prover that supports THF, FOF and CNF syntax. LEO-II is implemented in Objective CAML and its problem representation language is TPTP THF.
Keywords for this software
References in zbMATH (referenced in 29 articles , 1 standard article )
Showing results 1 to 20 of 29.
Sorted by year (- Benzmüller, C.; Weber, Leon; Woltzenlogel Paleo, Bruno: Computer-assisted analysis of the Anderson-Hájek ontological controversy (2017)
- Blanchette, Jasmin Christian; Böhme, Sascha; Fleury, Mathias; Smolka, Steffen Juilf; Steckermeier, Albert: Semi-intelligible Isar proofs from machine-generated proofs (2016)
- Brown, Chad E.; Urban, Josef: Extracting higher-order goals from the Mizar Mathematical Library (2016)
- Benzmüller, Christoph; Sultana, Nik; Paulson, Lawrence C.; Theiß, Frank: The higher-order prover Leo-II (2015)
- Foster, Simon; Struth, Georg: On the fine-structure of regular algebra (2015)
- Kühlwein, Daniel; Urban, Josef: MaLeS: a framework for automatic tuning of automated theorem provers (2015)
- Wisniewski, Max; Steen, Alexander; Benzmüller, Christoph: LeoPARD -- a generic platform for the implementation of higher-order reasoners (2015)
- Kaliszyk, Cezary; Urban, Josef: Learning-assisted automated reasoning with $\mathsfFlyspeck$ (2014)
- Benzmüller, Christoph; Paulson, Lawrence C.: Quantified multimodal logics in simple type theory (2013)
- Brown, Chad E.: Reducing higher-order theorem proving to a sequence of SAT problems (2013)
- Sultana, Nik; Blanchette, Jasmin Christian; Paulson, Lawrence C.: LEO-II and Satallax on the Sledgehammer test bench (2013)
- Brown, Chad E.: Satallax: an automatic higher-order prover (2012)
- Raths, Thomas; Otten, Jens: The QMLTP problem library for first-order modal logics (2012)
- Benzmüller, Christoph: Combining and automating classical and non-classical logics in classical higher-order logics (2011)
- Blanchette, Jasmin Christian; Böhme, Sascha; Paulson, Lawrence C.: Extending Sledgehammer with SMT solvers (2011)
- Brown, Chad E.: Reducing higher-order theorem proving to a sequence of SAT problems (2011)
- Rabe, Florian; Kohlhase, Michael; Sacerdoti Coen, Claudio: A foundational view on integration problems (2011)
- Backes, Julian; Brown, Chad E.: Analytic tableaux for higher-order logic with choice (2010)
- Benzmüller, Christoph: Combining logics in simple type theory (2010)
- Benzmüller, Christoph: Verifying the modal logic cube is an easy task (for higher-order automated reasoners) (2010)