\textsc{LeoPARD} -- a generic platform for the implementation of higher-order reasoners

From MaRDI portal
Publication:3453128

DOI10.1007/978-3-319-20615-8_22zbMATH Open1417.68196arXiv1505.01629OpenAlexW2963739488MaRDI QIDQ3453128FDOQ3453128


Authors: Max Wisniewski, Alexander Steen, Christoph Benzmüller Edit this on Wikidata


Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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 {lambda}-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.


Full work available at URL: https://arxiv.org/abs/1505.01629




Recommendations



Cites Work


Cited In (5)

Uses Software





This page was built for publication: \textsc{LeoPARD} -- a generic platform for the implementation of higher-order reasoners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453128)