Skip to main content
SpringerLink
Log in

LCF-Style Propositional Simplification with BDDs and SAT Solvers

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5170))

Included in the following conference series:

  • 780 Accesses

Abstract

We improve, in both a logical and a practical sense, the simplification of the propositional structure of terms in interactive theorem provers. The method uses Binary Decision Diagrams (BDDs) and SAT solvers. We present experimental results to show that the time cost is acceptable.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bryant, R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24(3), 293–318 (1992)

    Article  Google Scholar 

  2. Cyrluk, D., Rajan, S., Shankar, N., Srivas, M.K.: Effective theorem proving for hardware verification. In: Kumar, R., Kropf, T. (eds.) TPCD 1994. LNCS, vol. 901, pp. 203–222. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  3. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Fontaine, P., Marion, J.-Y., Merz, S., Nieto, L.P., Tiu, A.F.: Expressiveness + automation + soundness: Towards combining SMT solvers and interactive proof assistants. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol. 3920, pp. 167–181. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  6. Gershman, R., Koifman, M., Strichman, O.: Deriving small unsatisfiable cores with dominators. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 109–122. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Gordon, M.J.C.: Programming combinations of deduction and BDD-based symbolic calculation. LMS Journal of Computation and Mathematics 5, 56–76 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  8. Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: A theorem-proving environment for higher order logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  9. Harrison, J.: Binary decision diagrams as a HOL derived rule. The Computer Journal 38(2), 162–170 (1995)

    Article  Google Scholar 

  10. Harrison, J.: HOL Light. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 265–269. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  11. Harrison, J.: Stålmarck’s algorithm as a HOL derived rule. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 221–234. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  12. Huet, G., Kahn, G., Paulin-Mohring, C.: The Coq proof assistant: A tutorial: Version 7.2. Technical Report RT-0256, INRIA (February 2002)

    Google Scholar 

  13. Joyce, J.J., Seger, C.-J.H.: The HOL-Voss system: Model checking inside a general-purpose theorem prover. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol. 780, pp. 185–198. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  14. Kaufmann, M., Moore, J.: An industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering 23(4), 203–213 (1997)

    Article  Google Scholar 

  15. Mitchell, D.G.: A SAT solver primer. In: EATCS Bulletin. The Logic in Computer Science Column, EATCS, vol. 85, pp. 112–133 (February 2005)

    Google Scholar 

  16. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference, pp. 530–535. ACM Press, New York (2001)

    Google Scholar 

  17. Owre, S., Rushby, J.M., Shankar, N.: PVS: A prototype verification system. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 748–752. Springer, Heidelberg (1992), http://pvs.csl.sri.com

    Google Scholar 

  18. Paulson, L.C.: Isabelle. LNCS, vol. 828. Springer, Heidelberg (1994)

    Book  MATH  Google Scholar 

  19. Rajan, S., Shankar, N., Srivas, M.K.: An integration of model checking and automated proof checking. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 84–97. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  20. Tseitin, G.S.: On the complexity of derivation in propositional calculus. In: Siekmann, J., Wrightson, G. (eds.) Automation Of Reasoning: Classical Papers On Computational Logic, Vol. II, 1967-1970, pp. 466–483. Springer, Heidelberg (1983); Slisenko, A.O. (eds.) Structures in Constructive Mathematics and Mathematical Logic Part II, pp. 115–125 (1968)

    Chapter  Google Scholar 

  21. Verma, K.N., Goubault-Larrecq, J., Prasad, S., Arun-Kumar, S.: Reflecting BDDs in Coq. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 162–181. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  22. Weber, T., Amjad, H.: Efficiently checking propositional refutations in HOL theorem provers. JAL (2007) (accepted for publication, July 2007) (to appear)

    Google Scholar 

  23. Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: 6th SAT (2003) (presentation only)

    Google Scholar 

  24. Zhang, L.: On subsumption removal and on-the-fly CNF simplification. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 482–489. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  25. Zhang, L., Malik, S.: Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In: DATE, pp. 10880–10885. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Middlesex University School of Computing Science, London, NW4 4BT, UK

    Hasan Amjad

Authors
  1. Hasan Amjad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical and Computer Engineering, Concordia University, 1455 de Maisonneuve Blvd. W, H3G 1M8, Montreal, Quebec, Canada

    Otmane Ait Mohamed

  2. National Institute of Aerospace, 100 Exploration Way, VA 23666, Hampton, USA

    César Muñoz

  3. Dept. of Electrical & Computer Engineering, Concordia University, 1455 de Maisonette W, H3G 1M8, Montreal, Quebec, Canada

    Sofiène Tahar

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Amjad, H. (2008). LCF-Style Propositional Simplification with BDDs and SAT Solvers. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2008. Lecture Notes in Computer Science, vol 5170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71067-7_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71067-7_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71065-3

  • Online ISBN: 978-3-540-71067-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation