![]() Benzmüller, Christoph ![]() ![]() in IWIL Workshop and LPAR Short Presentations (2017, June 04) 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 ... [more ▼] 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 ordering constraints and, in tradition of its predecessor LEO-II, heavily relies on cooperation with external first-order theorem provers. Unlike LEO-II, asynchronous cooperation with typed first-order provers and an agent-based internal cooperation scheme is supported. In this paper, we sketch Leo-III's underlying calculus, survey implementation details and give examples of use. [less ▲] Detailed reference viewed: 111 (3 UL)![]() Steen, Alexander ![]() ![]() in IWIL Workshop and LPAR Short Presentations (2017, June 04) While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed lambda-calculi and ... [more ▼] While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed lambda-calculi and therefore do not allow such flexibility. In this paper, we present modifications to the higher-order automated theorem prover Leo-III for turning it into a reasoning system for rank-1 polymorphic HOL. To that end, a polymorphic version of HOL and a suitable paramodulation-based calculus are sketched. The implementation is evaluated using a set of polymorphic TPTP THF problems. [less ▲] Detailed reference viewed: 101 (4 UL)![]() Steen, Alexander ![]() in IWIL Workshop and LPAR Short Presentations (2017, June 04) Automated reasoning systems such as theorem provers often employ interaction or cooperation with further reasoning software. Whereas in most cases the concrete choice of cooperating software is, to some ... [more ▼] Automated reasoning systems such as theorem provers often employ interaction or cooperation with further reasoning software. Whereas in most cases the concrete choice of cooperating software is, to some extent, irrelevant, these systems are nevertheless often rigid in practice due to compatibility issues. In order to support more flexible cooperation schemes, a machine-readable description format for automated reasoning systems' capabilities is proposed. Additionally, a simple HTTP-based protocol for system and capability discovery is outlined. Both the format and the protocol are designed to be simple, extensible and easy to use with none to minor modifications for existing reasoning systems. [less ▲] Detailed reference viewed: 111 (2 UL)![]() ; Steen, Alexander ![]() ![]() in Benzmüller, Christoph; Otten, Jens (Eds.) ARQNL 2016. Automated Reasoning in Quantified Non-Classical Logics (2016, December) Detailed reference viewed: 35 (0 UL)![]() Steen, Alexander ![]() ![]() in Benzmüller, Christoph; Sutcliffe, Geoff; Rojas, Raul (Eds.) GCAI 2016, 2nd Global Conference on Artificial Intelligence (2016, September 29) Detailed reference viewed: 65 (0 UL)![]() Steen, Alexander ![]() ![]() in Greuel, GM; Koch, T; Paule, P (Eds.) et al Mathematical Software -- ICMS 2016, 5th International Congress, Proceedings (2016, July) Detailed reference viewed: 83 (0 UL)![]() ; Steen, Alexander ![]() in Olivetti, Nicola; Tiwari, Ashish (Eds.) Automated Reasoning --- 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 -- July 2, 2016, Proceedings (2016, June) Detailed reference viewed: 79 (0 UL)![]() Steen, Alexander ![]() ![]() Software (2016) Detailed reference viewed: 59 (4 UL)![]() ; Steen, Alexander ![]() ![]() in Schwill, Andreas; Lucke, Ulrike (Eds.) Hochschuldidaktik der Informatik: 7. Fachtagung des GI-Fachbereichs Informatik und Ausbildung/Didaktik der Informatik; 13.-14. September 2016 an der Universität Potsdam (2016) Detailed reference viewed: 45 (0 UL)![]() ; Steen, Alexander ![]() in Benzmüller, Christpoh; Otten, Jens (Eds.) ARQNL 2014. Automated Reasoning in Quantified Non-Classical Logics (2015, December) Detailed reference viewed: 68 (0 UL)![]() ; Steen, Alexander ![]() ![]() in Kerber, Manfred; Carette, Jacques; Kaliszyk, Cezary (Eds.) et al Intelligent Computer Mathematics - International Conference, CICM 2015, Washington, DC, USA, July 13-17, 2015, Proceedings (2015, June) Detailed reference viewed: 82 (0 UL)![]() Benzmüller, Christoph ![]() ![]() Report (2015) Detailed reference viewed: 65 (0 UL)![]() ; Steen, Alexander ![]() ![]() in Bolotov, Alexander; Kerber, Manfred (Eds.) Proceedings of the Joint Automated Reasoning Workshop and Deduktionstreffen: As part of the Vienna Summer of Logic – IJCAR 23-24 July 2014 (2014) Detailed reference viewed: 43 (0 UL) |
||