LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners

May 07, 2015 ยท The Ethereal ยท ๐Ÿ› International Conference on Intelligent Computer Mathematics

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Max Wisniewski, Alexander Steen, Christoph Benzmรผller arXiv ID 1505.01629 Category cs.LO: Logic in CS Cross-listed cs.AI, cs.MA, cs.MS Citations 21 Venue International Conference on Intelligent Computer Mathematics Last Checked 2 months ago
Abstract
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.
Community shame:
Not yet rated
๐Ÿ“„ View on arXiv ๐ŸŒ View on ar5iv ๐Ÿ“‘ PDF ๐ŸŽ‰ Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS