
PIE – Proving, Interpolating and Eliminating on the Basis of FirstOrder Logic
PIE is a Prologembedded environment for automated reasoning on the basi...
read it

Applying SecondOrder Quantifier Elimination in Inspecting Gödel's Ontological Proof
In recent years, Gödel's ontological proof and variations of it were for...
read it

Heinrich Behmann's Contributions to SecondOrder Quantifier Elimination from the View of Computational Logic
For relational monadic formulas (the Löwenheim class) secondorder quant...
read it

The Boolean Solution Problem from the Perspective of Predicate Logic  Extended Version
Finding solution values for unknowns in Boolean equations was a principa...
read it

KBSET  KnowledgeBased Support for Scholarly Editing and Text Processing
KBSET supports a practical workflow for scholarly editing, based on usin...
read it

A Tractable Logic for Molecular Biology
We introduce a logic for knowledge representation and reasoning on prote...
read it

Symbol Elimination for Parametric SecondOrder Entailment Problems (with Applications to Problems in Wireless Network Theory)
We analyze possibilities of secondorder quantifier elimination for form...
read it
Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of FirstOrder Logic
PIE is a Prologembedded environment for automated reasoning on the basis of firstorder logic. Its main focus is on formulas, as constituents of complex formalizations that are structured through formula macros, and as outputs of reasoning tasks such as secondorder quantifier elimination and Craig interpolation. It supports a workflow based on documents that intersperse macro definitions, invocations of reasoners, and LaTeXformatted natural language text. Starting from various examples, the paper discusses features and application possibilities of PIE along with current limitations and issues for future research.
READ FULL TEXT
Comments
There are no comments yet.