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

05/07/2015
by   Max Wisniewski, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/31/2021

Superposition with Lambdas

We designed a superposition calculus for a clausal fragment of extension...
research
09/06/2022

A Generic Type System for Higher-Order Ψ-calculi

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many ...
research
02/08/2018

The Higher-Order Prover Leo-III (Extended Version)

The automated theorem prover Leo-III for classical higher-order logic wi...
research
03/04/2019

Learning Ex Nihilo

This paper introduces, philosophically and to a degree formally, the nov...
research
01/11/2021

Object-Level Reasoning with Logics Encoded in HOL Light

We present a generic framework that facilitates object level reasoning w...
research
04/21/2020

The Imandra Automated Reasoning System (system description)

We describe Imandra, a modern computational logic theorem prover designe...
research
05/13/2022

Lash 1.0 (System Description)

Lash is a higher-order automated theorem prover created as a fork of the...

Please sign up or login with your details

Forgot password? Click here to reset