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

Authors:
Konstantin Korovin
Affiliations:
School of Computer Science, The University of Manchester,
Venue:
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Year:
2008

Citing 6
Cited 24

Term Indexing

Term Indexing
New Directions in Instantiation-Based Theorem Proving

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The design and implementation of VAMPIRE

AI Communications - CASC
E - a brainiac theorem prover

AI Communications - CASC
Splitting without backtracking

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Theory instantiation

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Instantiation-Based Automated Reasoning: From Theory to Practice

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Merging Sets of Taxonomically Organized Data Using Concept Mappings under Uncertainty

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part II
The 5th IJCAR automated theorem proving system competition - CASC-J5

AI Communications
ESAT: a tool for animating logic-based specifications of evolvable component systems

RV'10 Proceedings of the First international conference on Runtime verification
Invariant generation in vampire

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Encoding industrial hardware verification problems into effectively propositional logic

Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Efficient CNF simplification based on binary implication graphs

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
The Matita interactive theorem prover

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Reducing higher-order theorem proving to a sequence of SAT problems

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Experimenting with deduction modulo

CADE'11 Proceedings of the 23rd international conference on Automated deduction
A Combined Superposition and Model Evolution Calculus

Journal of Automated Reasoning
Invariant and type inference for matrices

VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
A slice-based decision procedure for type-based partial orders

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
iProver-Eq: an instantiation-based theorem prover with equality

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
On the saturation of YAGO

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Model Evolution with equality - Revised and implemented

Journal of Symbolic Computation
EPR-based bounded model checking at word level

IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Machine learning approach to enhance the design of automated theorem provers

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part II
One logic to use them all

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Quantifier instantiation techniques for finite model finding in SMT

CADE'13 Proceedings of the 24th international conference on Automated Deduction
E-MaLeS 1.1

CADE'13 Proceedings of the 24th international conference on Automated Deduction
The 481 ways to split a clause and deal with propositional variables

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Simple and efficient clause subsumption with feature vector indexing

Automated Reasoning and Mathematics
SMELS: Satisfiability Modulo Equality with Lazy Superposition

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.