6 research outputs found

    Set of support, demodulation, paramodulation: a historical perspective

    Get PDF
    This article is a tribute to the scientific legacy of automated reasoning pioneer and JAR founder Lawrence T. (Larry) Wos. Larry's main technical contributions were the set-of-support strategy for resolution theorem proving, and the demodulation and paramodulation inference rules for building equality into resolution. Starting from the original definitions of these concepts in Larry's papers, this survey traces their evolution, unearthing the often forgotten trails that connect Larry's original definitions to those that became standard in the field

    Eight Biennial Report : April 2005 – March 2007

    No full text

    Comparing Instance Generation Methods for Automated Reasoning

    No full text

    U.: Comparing instance generation methods for automated reasoning

    No full text
    Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of these clauses that can be shown to be propositionally unsatisfiable. In recent years, this approach has been refined in several directions, leading to both tableau-based methods, such as the Disconnection Tableau Calculus, and saturationbased methods, such as Primal Partial Instantiation and Resolution-Based Instance Generation. We investigate the relationship between these calculi and answer the question to what extent refutation or consistency proofs in one calculus can be simulated in another one
    corecore