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

Konstantin Korovin, Christoph Sticksel

    Research output: Chapter in Book/Conference proceedingConference contributionpeer-review

    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.
    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.
    PublisherSpringer Nature
    Pages196-202
    Number of pages6
    Volume6173
    ISBN (Print)3642142028, 9783642142024
    DOIs
    Publication statusPublished - 2010
    Event5th International Joint Conference on Automated Reasoning, IJCAR 2010 - Edinburgh
    Duration: 1 Jul 2010 → …

    Publication series

    NameLecture Notes in Computer Science

    Conference

    Conference5th International Joint Conference on Automated Reasoning, IJCAR 2010
    CityEdinburgh
    Period1/07/10 → …

    Keywords

    • automated reasoning, instantiation-based methods, implementation techniques

    Fingerprint

    Dive into the research topics of 'iProver-Eq: An instantiation-based theorem prover with equality'. Together they form a unique fingerprint.

    Cite this