DeepAI AI Chat

Generating theorem proving procedures from axioms of Truncated Predicate Calculus

07/29/2019

∙

by Grzegorz Wiaderek, et al.

∙

infoster.com.pl

∙

∙

We present a novel approach to the problem of automated theorem proving. Polynomial cost procedures that recognise sentences belonging to a theory are generated on a basis of a set of axioms of the so-called Truncated Predicate Calculus being a subset of standard predicate calculus. Several exemplary problems are included to show the performance of the proposed approach.

Grzegorz Wiaderek
1 publication
Iwona Skalna
2 publications

page 1

page 2

page 3

page 4

∙ 02/22/2022

A Heuristic Proof Procedure for Propositional Logic

Theorem proving is one of the oldest applications which require heuristi...

0 Keehang Kwon, et al. ∙

∙ 01/28/2020

Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software ana...

0 Bernhard Gleiss, et al. ∙

∙ 02/15/2017

Theorem Proving Based on Semantics of DNA Strand Graph

Because of several technological limitations of traditional silicon base...

0 Kumar S. Ray, et al. ∙

∙ 03/21/2023

An implicit function theorem for the stream calculus

In the context of the stream calculus, we present an Implicit Function T...

0 Michele Boreale, et al. ∙

∙ 03/23/2023

Planning as Theorem Proving with Heuristics

Planning as theorem proving in situation calculus was abandoned 50 years...

0 Mikhail Soutchanski, et al. ∙

∙ 07/22/2021

A Typed Slicing Compilation of the Polymorphic RPC Calculus

The polymorphic RPC calculus allows programmers to write succinct multit...

0 Kwanghoon Choi, et al. ∙

∙ 09/13/2022

Monadic and Comonadic Aspects of Dependency Analysis

Dependency analysis is vital to several applications in computer science...

0 Pritam Choudhury, et al. ∙