A Novel Technique for Computing Craig Interpolants in Satisfiabilility Modulo the Theory of Integer Linear Arithmetic

Le, Thi Thieu Hoa (2010) A Novel Technique for Computing Craig Interpolants in Satisfiabilility Modulo the Theory of Integer Linear Arithmetic. [Departmental Technical Report] (Unpublished)

[img]
Preview
 PDF
Download (327Kb) | Preview

    Abstract

    In this thesis we present a solution to the interpolation problem of LA(Z) based on interpolant generation for conjunctions of LA(Z) equalities and weak inequalities. Although our approach was inspired by Brillout et al.’s interpolating sequent calculus, it differs from the latter in that our interpolation method is based on cutting-plane proofs of unsatisfiability rather than sequent-calculus proofs and consists of interpolation rules built to reflect the cutting plane rules. The proposed algorithm has been implemented within MATHSAT SMT solver and tested for simple cases.

    Item Type: Departmental Technical Report
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Department or Research center: Information Engineering and Computer Science
    Repository staff approval on: 20 Dec 2010
    Last Modified: 28 Feb 2012 15:24
    URI: http://eprints.biblio.unitn.it/id/eprint/1914

    Actions (login required)

    		 View Item