iProver – An Instantiation-Based Theorem Prover for First-Order Logic (System Description)

iProver is an instantiation-based theorem prover which is based on Inst-Gen calculus, complete for first-order logic. One of the distinctive features of iProver is a modular combination of instantiation and propositional reasoning. In particular, any state-of-the art SAT solver can be integrated int...

Full description

Saved in:
Bibliographic Details
Published inAutomated Reasoning pp. 292 - 298
Main Author Korovin, Konstantin
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Subjects
Ground Clause
Input Clause
Propositional Reasoning
Redundancy Elimination
Saturation Algorithm
Online AccessGet full text

Cover

More Information
Summary:iProver is an instantiation-based theorem prover which is based on Inst-Gen calculus, complete for first-order logic. One of the distinctive features of iProver is a modular combination of instantiation and propositional reasoning. In particular, any state-of-the art SAT solver can be integrated into our framework. iProver incorporates state-of-the-art implementation techniques such as indexing, redundancy elimination, semantic selection and saturation algorithms. Redundancy elimination implemented in iProver include: dismatching constraints, blocking non-proper instantiations and propositional-based simplifications. In addition to instantiation, iProver implements ordered resolution calculus and a combination of instantiation and ordered resolution. In this paper we discuss the design of iProver and related implementation issues.
ISBN:3540710698
9783540710691
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-71070-7_24