LeoPARD -- a generic platform for the implementation of higher-order reasoners. LeoPARD supports the implementation of knowledge representation and reasoning tools for higher-order logic(s). It combines a sophisticated data structure layer (polymorphically typed λ-calculus with nameless spine notation, explicit substitutions, and perfect term sharing) with an ambitious multi-agent blackboard architecture (supporting prover parallelism at the term, clause, and search level). Further features of LeoPARD include a parser for all TPTP dialects, a command line interpreter, and generic means for the integration of external reasoners.
Keywords for this software
References in zbMATH (referenced in 6 articles , 1 standard article )
Showing results 1 to 6 of 6.
- Steen, Alexander; Benzmüller, Christoph: The higher-order prover Leo-III (2018)
- Färber, Michael; Kaliszyk, Cezary; Urban, Josef: Monte Carlo tableau proof search (2017)
- Benzmüller, Christoph; Scott, Dana: Automating free logic in Isabelle/HOL (2016)
- Steen, Alexander; Wisniewski, Max; Benzmüller, Christoph: Agent-based HOL reasoning (2016)
- Steen, Alexander; Benzmüller, Christoph: There is no best (\beta)-normalization strategy for higher-order reasoners (2015)
- Wisniewski, Max; Steen, Alexander; Benzmüller, Christoph: \textscLeoPARD-- a generic platform for the implementation of higher-order reasoners (2015)