PIE – Proving, Interpolating and Eliminating on the Basis of First-Order Logic

08/29/2019
by   Christoph Wernhard, et al.
0

PIE is a Prolog-embedded environment for automated reasoning on the basis of first-order logic. It includes a versatile formula macro system and supports the creation of documents that intersperse macro definitions, reasoner invocations and LaTeX-formatted natural language text. Invocation of various reasoners is supported: External provers as well as sub-systems of PIE, which include preprocessors, a Prolog-based first-order prover, methods for Craig interpolation and methods for second-order quantifier elimination.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2020

Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic

PIE is a Prolog-embedded environment for automated reasoning on the basi...
research
10/21/2021

Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof

In recent years, Gödel's ontological proof and variations of it were for...
research
06/26/2017

The Boolean Solution Problem from the Perspective of Predicate Logic - Extended Version

Finding solution values for unknowns in Boolean equations was a principa...
research
12/19/2017

Heinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic

For relational monadic formulas (the Löwenheim class) second-order quant...
research
07/04/2019

Second-order semi-implicit projection methods for micromagnetics simulations

Micromagnetics simulations require accurate approximation of the magneti...
research
08/08/2020

Craig Interpolation with Clausal First-Order Tableaux

We develop foundations for computing Craig-Lyndon interpolants of two gi...

Please sign up or login with your details

Forgot password? Click here to reset