iProver-Eq: An instantiation-based theorem prover with equality

13Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with superposition-based equational reasoning and maintains the distinctive features of the Inst-Gen method. In particular, first-order reasoning is combined with efficient ground satisfiability checking where the latter is delegated in a modular way to any state-of-the-art SMT solver. The first-order reasoning employs a saturation algorithm making use of redundancy elimination in form of blocking and simplification inferences. We describe the equational reasoning as it is implemented in iProver-Eq, the main challenges and techniques that are essential for efficiency. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Korovin, K., & Sticksel, C. (2010). iProver-Eq: An instantiation-based theorem prover with equality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6173 LNAI, pp. 196–202). https://doi.org/10.1007/978-3-642-14203-1_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free