Efficiently checking propositional refutations in HOL theorem provers

Journal of Applied Logic

Volumn 7, Issue 1, 2009, Pages 26-40

  Weber, Tjark ^a   Amjad, Hasan ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Interactive theorem proving; LCF style proof checking; Propositional resolution

Indexed keywords

LASER FUSION; OPEN SYSTEMS; PROBLEM SOLVING;

#SAT PROBLEMS; HIGHER ORDER LOGIC (HOL); HOL THEOREM PROVERS; INTERACTIVE THEOREM PROVING; LCF-STYLE PROOF CHECKING; PROPOSITIONAL RESOLUTION; SATISFIABILITY (SAT) SOLVERS;

THEOREM PROVING;

EID: 58549101153     PISSN: 15708683     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jal.2007.07.003     Document Type: Article

References (45)

1. Audemard G., Bertoli P., Cimatti A., Kornilowicz A., and Sebastiani R. A SAT based approach for solving formulas over Boolean and linear mathematical propositions. In: Voronkov A. (Ed). Proceedings of the 18th International Conference on Automated Deduction (CADE-18). Copenhagen, Denmark, July 2002. Lecture Notes in Artificial Intelligence vol. 2392 (2002), Springer 195-210
2. Amjad H. Shallow lazy proofs. In: Hurd J., and Melham T. (Eds). Proceedings of the 18th International Conference on Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 3603 (2005), Springer 35-49
3. H. Amjad, Compressing propositional refutations, in: S. Merz, T. Nipkow (Eds.), Sixth International Workshop on Automated Verification of Critical Systems (AVOCS '06)-Preliminary Proceedings, 2006, pp. 7-18
4. Anbulagan, J. Slaney, Multiple preprocessing for systematic SAT solvers, in: C. Benzmüller, B. Fischer, G. Sutcliffe (Eds.), Proceedings of the 6th International Workshop on the Implementation of Logics, CEUR Workshop Proceedings, vol. 212, Phnom Penh, Cambodia, 2006, pp. 100-116
5. C.W. Barrett, Checking validity of quantifier-free formulas in combinations of first-order theories, PhD thesis, Stanford University, Stanford, California, January 2003
6. C. Barrett, S. Berezin, CVC lite: A new implementation of the cooperating validity checker, in: Proceedings of the 16th International Conference on Computer Aided Verification (CAV 2004), Boston, Massachusetts, USA, July 2004
7. C. Barrett, S. Berezin, D.L. Dill, A proof-producing Boolean search engine, in: Proceedings of the Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR 2003), Miami, Florida, USA, July 2003
8. DIMACS satisfiability suggested format (1993). ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/doc
9. de Nivelle H., and Meng J. Geometric resolution: A proof procedure based on finite model search. In: Furbach U., and Shankar N. (Eds). Automated Reasoning-Third International Joint Conference, IJCAR 2006, Proceedings. Seattle, WA, USA, August 2006. Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 303-317
10. Eén N., and Biere A. Effective preprocessing in SAT through variable and clause elimination. In: Bacchus F., and Walsh T. (Eds). SAT. Lecture Notes in Computer Science vol. 3569 (2005), Springer 61-75
11. Eén N., and Sörensson N. An extensible SAT-solver. In: Giunchiglia E., and Tacchella A. (Eds). Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, Selected Revised Papers. Santa Margherita Ligure, Italy, May 5-8, 2003. Lecture Notes in Computer Science vol. 2919 (2004), Springer 502-518
12. Eén N., and Sörensson N. MiniSat-p-v1.14-A proof-logging version of MiniSat, September 2006. http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/
13. Fontaine P., Marion J.-Y., Merz S., Prensa Nieto L., and Tiu A. Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In: Hermanns H., and Palsberg J. (Eds). Tools and Algorithms for the Construction and Analysis of Systems, 12th International Conference, TACAS 2006 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Proceedings. Vienna, Austria, March 25-April 2, 2006. Lecture Notes in Computer Science vol. 3920 (2006), Springer 167-181
14. In: Gordon M.J.C., and Melham T.F. (Eds). Introduction to HOL: A Theorem Proving Environment for Higher Order Logic (1993), Cambridge University Press
15. Gordon M.J.C. From LCF to HOL: A short history. In: Plotkin G., Stirling C.P., and Tofte M. (Eds). Proof, Language, and Interaction (2000), MIT Press
16. Gordon M.J.C. HolSatLib 1.0b (June 2001). http://www.cl.cam.ac.uk/~mjcg/HolSatLib/HolSatLib.html
17. Harrison J. Binary decision diagrams as a HOL derived rule. The Computer Journal 38 2 (1995) 162-170
18. Harrison J. HOL light: A tutorial introduction. In: Srivas M.K., and Camilleri A.J. (Eds). FMCAD. Lecture Notes in Computer Science vol. 1166 (1996), Springer 265-269
19. Harrison J. Stålmarck's algorithm as a HOL derived rule. In: von Wright J., Grundy J., and Harrison J. (Eds). Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science vol. 1125 (1996), Springer 221-234
20. Hoos H.H., and Stützle T. SATLIB: An online resource for research on SAT. In: Gent I., van Maaren H., and Walsh T. (Eds). SAT 2000 (2000), IOS Press 283-292. http://www.satlib.org/
21. Hurd J. Integrating Gandalf and HOL. In: Bertot Y., Dowek G., Hirschowitz A., Paulin C., and Théry L. (Eds). Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs '99. Nice, France, September 1999. Lecture Notes in Computer Science vol. 1690 (1999), Springer 311-321
22. Hurd J. An LCF-style interface between HOL and first-order logic. In: Voronkov A. (Ed). Proceedings of the 18th International Conference on Automated Deduction (CADE-18). Copenhagen, Denmark, July 2002. Lecture Notes in Artificial Intelligence vol. 2392 (2002), Springer 134-138
23. C. Hurlin, Proof reconstruction for first-order logic and set-theoretical constructions, in: S. Merz, T. Nipkow (Eds.), Sixth International Workshop on Automated Verification of Critical Systems (AVOCS '06)-Preliminary Proceedings, 2006, pp. 157-162
24. Kumar R., Kropf T., and Schneider K. Integrating a first-order automatic prover in the HOL environment. In: Archer M., Joyce J.J., Levitt K.N., and Windley P.J. (Eds). Proceedings of the 1991 International Workshop on the HOL Theorem Proving System and its Applications. Davis, California, USA, August 1991 (1992), IEEE Computer Society Press 170-176
25. McLaughlin S., Barrett C., and Ge Y. Cooperating theorem provers: A case study combining CVC Lite and HOL Light. In: Armando A., and Cimatti A. (Eds). PDPAR. Electronic Notes in Theoretical Computer Science vol. 144 (2005), Springer 43-51
26. Meier A. TRAMP: Transformation of machine-found proofs into natural deduction proofs at the assertion level. In: McAllester D.A. (Ed). Automated Deduction-CADE-17, 17th International Conference on Automated Deduction, Proceedings. Pittsburgh, PA, USA, June 17-20, 2000. Lecture Notes in Artificial Intelligence vol. 1831 (2000), Springer 460-464
27. J. Meng, Integration of interactive and automatic provers, in: M. Carro, J. Correas (Eds.), Second CologNet Workshop on Implementation Technology for Computational Logic Systems, FME 2003, September 2003
28. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, Chaff: Engineering an efficient SAT solver, in: Proceedings of the 38th Design Automation Conference, Las Vegas, June 2001
29. Meng J., and Paulson L.C. Experiments on supporting interactive proof using resolution. In: Basin D., and Rusinowitch M. (Eds). Automated Reasoning: Second International Joint Conference, IJCAR 2004, Proceedings. Cork, Ireland, July 4-8, 2004. Lecture Notes in Artificial Intelligence vol. 3097 (2004), Springer 372-384
30. J. Meng, L.C. Paulson, Translating higher-order problems to first-order clauses, in: G. Sutcliffe, R. Schmidt, S. Schulz (Eds.), ESCoR: Empirically Successful Computerized Reasoning, CEUR Workshop Proceedings, vol. 192, 2006, pp. 70-80
31. Meier A., and Sorge V. Applying SAT solving in classification of finite algebras. Journal of Automated Reasoning 35 1-3 (2005) 201-235
32. Milner R., Tofte M., Harper R., and MacQueen D. The Definition of Standard ML-Revised (1997), MIT Press, May
33. Nipkow T., Paulson L.C., and Wenzel M. Isabelle/HOL-A Proof Assistant for Higher-Order Logic. Lecture Notes in Computer Science vol. 2283 (2002), Springer
34. Nonnengart A., Rock G., and Weidenbach C. On generating small clause normal forms. In: Kirchner C., and Kirchner H. (Eds). Automated Deduction-CADE-15, 15th International Conference on Automated Deduction, Proceedings. Lindau, Germany, July 5-10, 1998. Lecture Notes in Computer Science vol. 1421 (1998), Springer 397-411
35. Owre S., Rushby J.M., and Shankar N. PVS: A prototype verification system. In: Kapur D. (Ed). 11th International Conference on Automated Deduction (CADE). Saratoga, NY, June 1992. Lecture Notes in Artificial Intelligence vol. 607 (1992), Springer 748-752
36. Paulson L.C. Isabelle: A Generic Theorem Prover. Lecture Notes in Computer Science vol. 828 (1994), Springer
37. Reeber E., and Hunt Jr. W.A. A SAT-based decision procedure for the subclass of unrollable list formulas in ACL2 (SULFA). In: Furbach U., and Shankar N. (Eds). Automated Reasoning-Third International Joint Conference, IJCAR 2006, Proceedings. Seattle, WA, USA, August 2006. Lecture Notes in Artificial Intelligence vol. 4130 (2006), Springer 453-467
38. Shankar N. Using decision procedures with a higher-order logic. In: Boulton R.J., and Jackson P.B. (Eds). Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs 2001, Proceedings. Edinburgh, Scotland, UK, September 3-6, 2001. Lecture Notes in Computer Science vol. 2152 (2001), Springer 5-26
39. Strichman O. On solving Presburger and linear arithmetic with SAT. In: Aagaard M.D., and O'Leary J.W. (Eds). Formal Methods in Computer-Aided Design: 4th International Conference, FMCAD 2002, Proceedings. Portland, OR, USA, November 6-8, 2002. Lecture Notes in Computer Science vol. 2517 (2002), Springer 160-169
40. Tseitin G.S. On the complexity of derivation in propositional calculus. In: Siekmann J., and Wrightson G. (Eds). Automation of Reasoning: Classical Papers on Computational Logic, vol. II, 1967-1970 (1983), Springer 466-483 Also
41. Tseitin G.S. On the complexity of derivation in propositional calculus. In: Slisenko A.O. (Ed). Structures in Constructive Mathematics and Mathematical Logic, Part II (1968) 115-125
42. T. Weber, Integrating a SAT solver with an LCF-style theorem prover, in: A. Armando, A. Cimatti (Eds.), Proceedings of PDPAR'05-Third International Workshop on Pragmatical Aspects of Decision Procedures in Automated Reasoning, Edinburgh, UK, July 2005
43. T. Weber, Using a SAT solver as a fast decision procedure for propositional logic in an LCF-style theorem prover, in: J. Hurd, E. Smith, A. Darbari (Eds.), Theorem Proving in Higher Order Logics-18th International Conference, TPHOLs 2005, Oxford, UK, August 2005, Emerging Trends Proceedings, Oxford, UK, August 2005, pp. 180-189; Oxford University Computing Laboratory, Programming Research Group, Research Report PRG-RR-05-02
44. Zhang L. On subsumption removal and on-the-fly CNF simplification. In: Bacchus F., and Walsh T. (Eds). SAT. Lecture Notes in Computer Science vol. 3569 (2005), Springer 482-489
45. Zhang L., and Malik S. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. Design, Automation and Test in Europe (DATE 2003) (2003), IEEE Computer Society 10880-10885