@inproceedings{Korovin2010Labelled,
    abstract = {The Inst-Gen-Eq method is an instantiation-based calculus which is complete for first-order clause logic modulo equality. Its distinctive feature is that it combines first-order reasoning with efficient ground satisfiability checking which is delegated in a modular way to any state-of-the-art ground SMT solver. The first-order reasoning modulo equality employs a superposition-style calculus which generates the instances needed by the ground solver to refine a model of a ground abstraction or to witness unsatisfiability.
In this paper we present and compare different labelling mechanisms in the unit superposition calculus that facilitates finding the necessary instances. We demonstrate and evaluate how different label structures such as sets, AND/OR trees and OBDDs affect the interplay between the proof procedure and blocking mechanisms for redundancy elimination.},
    address = {Heidelberg},
    author = {Konstantin Korovin and Christoph Sticksel},
    booktitle = {17th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR-17},
    editor = {Christian G. Ferm\"{u}ller and Andrei Voronkov},
    location = {Yogyakarta, Indonesia},
    pages = {445-473},
    publisher = {Springer},
    series = {Lecture Notes in Computer Science},
    title = {Labelled Unit Superposition Calculi for Instantiation-based Reasoning},
    volume = {6397},
    year = {2010}
}