nanoCoP: A Non-clausal Connection Prover

@inproceedings{Otten2016nanoCoPAN,
  title={nanoCoP: A Non-clausal Connection Prover},
  author={Jens Otten},
  booktitle={IJCAR},
  year={2016}
}
  • J. Otten
  • Published in IJCAR 27 June 2016
  • Computer Science
Most of the popular efficient proof search calculi work on formulae that are in clausal form, i.e. in disjunctive or conjunctive normal form. Hence, most state-of-the-art fully automated theorem provers require a translation of the input formula into clausal form in a preprocessing step. Translating a proof in clausal form back into a more readable non-clausal proof of the original formula is not straightforward. This paper presents a non-clausal theorem prover for classical first-order logic… 

nanoCoP: Natural Non-clausal Theorem Proving

TLDR
Working entirely on the original structure of the input formula yields not only a speed up of the proof search, but the resulting non-clausal proofs are also shorter.

Non-clausal Connection-based Theorem Proving in Intuitionistic First-Order Logic

TLDR
Details of the compact Prolog code are presented, which extends the non-clausal connection prover nanoCoP for classical logic by prefixes and an additional prefix unification, which encode the Kripke semantics of intuitionistic logic.

Non-clausal Connection Calculi for Non-classical Logics

  • J. Otten
  • Computer Science, Philosophy
    TABLEAUX
  • 2017
TLDR
An experimental evaluation shows that non-clausal connection calculi are a solid basis for proof search in these logics, in terms of time complexity and proof size.

Advances in Connection-Based Automated Theorem Proving

TLDR
Calculi to automate theorem proving in classical and some important non-classical logics, namely first- order intuitionistic and first-order modal logics are presented, which permits a goal-oriented and, hence, a more efficient proof search.

Certification of Nonclausal Connection Tableaux Proofs

TLDR
A translation of nonclausal connection proofs to Gentzen’s sequent calculus LK is given and implemented in the interactive theorem prover HOL Light, enabling certification of nonclosure connection proofs as well as a new, complementary automation technique in HOL Light.

Towards the Integration of an Intuitionistic First-Order Prover into Coq

TLDR
This work proposes a two-phase approach: An intuitionistic prover generates a certificate based on the matrix characterization of intuitionistic first-order logic; the certificate is then translated into a sequent-style proof.

Proof Search Optimizations for Non-Clausal Connection Calculi

TLDR
The paper presents several proof search optimization techniques for non-clausal connection calculi that are the basis of the new version 1.1 of nanoCoP, and is evaluated on the problems in the TPTP library.

Equality Preprocessing in Connection Calculi

TLDR
This work presents an extensible system for equality preprocessing in connection calculi (EPICC) that can be used as a tool in reducing the search space of problems that contain equality.

A Vision for Automated Deduction Rooted in the Connection Method

TLDR
An informal overview of the Connection Method in Automated Deduction points out its unique advantage over competing methods which consists in its formula-orientedness and envisages a bright future for the field and point out promising directions for future research.

Machine Learning Guidance and Proof Certification for Connection Tableaux

TLDR
This work gives a translation of connection proofs to LK, enabling proof certification and automatic proof search in interactive theorem provers and shows two guidance methods based on machine learning, namely reordering of proof steps with Naive Bayesian probablities, and expansion of a proof search tree with Monte Carlo Tree Search.

References

SHOWING 1-10 OF 24 REFERENCES

A Non-clausal Connection Calculus

A non-clausal connection calculus for classical first-order logic is presented that does not require the translation of input formulae into any clausal form. The definition of clauses is generalized,

A Structure-Preserving Clause Form Translation

Advances in Connection-Based Automated Theorem Proving

TLDR
Calculi to automate theorem proving in classical and some important non-classical logics, namely first- order intuitionistic and first-order modal logics are presented, which permits a goal-oriented and, hence, a more efficient proof search.

Connection-based Theorem Proving in Classical and Non-classical Logics

We present a uniform procedure for proof search in classical logic, intuition- istic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in

MleanCoP: A Connection Prover for First-Order Modal Logic

TLDR
MleanCoP is a fully automated theorem prover for first-order modal logic that supports heterogeneous multimodal logics and outputs a compact prefixed connection proof.

Restricting backtracking in connection calculi

TLDR
The results show that restricted backtracking is a successful technique when performing proof search in connection calculi and provides the basis for a refined connection calculus.

Importing SMT and Connection proofs as expansion trees

TLDR
An implementation that takes SMT and Connection proof objects from two different provers and imports them both as expansion trees so that all the algorithms and tools available for expansion trees can be employed uniformly.

Theorem Proving via General Matings

TLDR
It is shown that one may restrict quantifier duphcat, on to outermost quanUfiers without loss of completeness, though with possible loss of efficmncy.

A prolog technology theorem prover: Implementation by an extended prolog compiler

  • M. Stickel
  • Computer Science
    Journal of Automated Reasoning
  • 2004
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs

JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants

TLDR
A brief overview of JProver's proof technique, the generation of proof objects, and its integration into the Nuprl proof development system are given.