Computing Interpolants without Proofs

We describe an incremental algorithm for computing interpolants for a pair ϕA, ϕB of formulas in propositional logic. In contrast with the common approaches, our method does not require a proof of unsatisfiability of ϕA∧ϕB, and can be realized using any SAT solver as a black box. We achieve this by combining model enumeration with the ability to easily generate interpolants in the special case that one of the formulas is a cube.

[1]  A. Mishchenko,et al.  Scalable exploration of functional dependency by interpolation and incremental SAT solving , 2007, ICCAD 2007.

[2]  Eugene Goldberg,et al.  Quantifier elimination by dependency sequents , 2012, Formal Methods in System Design.

[3]  Allen Van Gelder,et al.  Partitioning Methods for Satisfiability Testing on Large Formulas , 1996, CADE.

[4]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[5]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[6]  Kenneth L. McMillan,et al.  Applications of Craig Interpolants in Model Checking , 2005, TACAS.

[7]  Fabio Somenzi,et al.  Prime clauses for fast enumeration of satisfying assignments to Boolean circuits , 2005, Proceedings. 42nd Design Automation Conference, 2005..

[8]  Panagiotis Manolios,et al.  Faster SAT solving with better CNF generation , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[9]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

[10]  Daniel Kroening,et al.  Verification and falsification of programs with loops using predicate abstraction , 2010, Formal Aspects of Computing.

[11]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

[12]  Jie-Hong Roland Jiang,et al.  Bi-decomposing large Boolean functions via interpolation and satisfiability solving , 2008, 2008 45th ACM/IEEE Design Automation Conference.

[13]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[14]  Albert Oliveras,et al.  Practical algorithms for unsatisfiability proof and core generation in SAT solvers , 2010, AI Commun..

[15]  Alain Hertz,et al.  Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems , 2009, J. Comb. Optim..

[16]  Aaron R. Bradley,et al.  SAT-Based Model Checking without Unrolling , 2011, VMCAI.

[17]  William Craig,et al.  Linear reasoning. A new form of the Herbrand-Gentzen theorem , 1957, Journal of Symbolic Logic.

[18]  Sharad Malik,et al.  Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[19]  Kenneth L. McMillan,et al.  Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.

[20]  Karem A. Sakallah,et al.  Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings , 2011, SAT.

[21]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[22]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[23]  Kousha Etessami,et al.  Analysis of Recursive Game Graphs Using Data Flow Equations , 2004, VMCAI.

[24]  Jörg Brauer,et al.  Existential Quantification as Incremental SAT , 2011, CAV.

[25]  Alexander Nadel.  Boosting minimal unsatisfiable core extraction , 2010, Formal Methods in Computer Aided Design.

[26]  Inês Lynce,et al.  On Improving MUS Extraction Algorithms , 2011, SAT.

[27]  Kenneth L. McMillan.  Lazy Annotation for Program Testing and Verification , 2010, CAV.

[28]  Kenneth L. McMillan,et al.  Interpolation and SAT-Based Model Checking , 2003, CAV.