Skip to main content
SpringerLink
Log in

Stålmarck’s algorithm as a HOL derived rule

  • Conference paper
  • First Online:
Theorem Proving in Higher Order Logics (TPHOLs 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1125))

Included in the following conference series:

Abstract

Stålmarck’s algorithm is a patented technique for tautology-checking which has been used successfully for industrial-scale problems. Here we describe the algorithm and explore its implementation as a HOL derived rule.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Bernays and M. Schönfinkel. Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen, 99:401–419, 1928.

    Article  Google Scholar 

  2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677–691, 1986.

    Google Scholar 

  3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24:293–318, 1992.

    Article  Google Scholar 

  4. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.

    Google Scholar 

  5. M. D'Agostino. Investigations into the complexity of some propositional calculi. Technical Monograph PRG-88, Oxford University Computing Laboratory, Programming Research Group, 11 Keble Road, Oxford, OX1 3QD, 1990. Author's PhD thesis.

    Google Scholar 

  6. M. Di Manzo, E. Giunchiglia, A. Armando, and P. Pecchiari. Proving formulas through reduction to decidable classes. In P. Torasso, editor, Proceedings of the 3rd Congress of the Italian Association for Artificial Intelligence, AI*IA’ 93, volume 728 of Lecture Notes in Computer Science, pages 1–10. Springer-Verlag, 1993.

    Google Scholar 

  7. J. F. Groote. Hiding propositional constants in BDDs. Formal Methods in System Design, 8:91–96, 1996.

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. J. N. Hooker. A quantitative approach to logical inference. Decision Support Systems, 4:45–69, 1988.

    Article  Google Scholar 

  10. R. G. Jereslow. Computation-oriented reductions of predicate to propositional logic. Decision Support Systems, 4:183–197, 1988.

    Article  Google Scholar 

  11. U. K. Ministry of Defence. The procurement of safety critical software in defence equipment. Interim Defence Standard 00-55, MOD Directorate of Standardization, Kentigern House, 65 Brown Stree, Glasgow G2 8EX, UK, 1991.

    Google Scholar 

  12. M. Säflund. Modelling and formally verifying systems and software in industrial applications. Unpublished; available from the National Physical Laboratory, Teddington, Middlesex, TW11 0LW, UK, 1994.

    Google Scholar 

  13. G. Stålmarck. A proof theoretic concept of tautological hardness. Unpublished manuscript, 1994.

    Google Scholar 

  14. G. Stålmarck. System for determining propositional logic theorems by applying values and rules to triplets that are generated from Boolean formula. United States Patent number 5,276,897; see also Swedish Patent 467 076, 1994.

    Google Scholar 

  15. G. Stålmarck and M. Säflund. Modeling and verifying systems and software in propositional logic. In B. K. Daniels, editor, Safety of Computer Control Systems, 1990 (SAFECOMP’ 90), pages 31–36, Gatwick, UK, 1990. Pergamon Press.

    Google Scholar 

  16. C. B. Suttner and G. Sutcliffe. The TPTP problem library. Technical Report AR-95-03, Institut für Infomatik, TU München, Germany, 1995. Also available as TR 95/6 from Dept. Computer Science, James Cook University, Australia, and on the Web.

    Google Scholar 

  17. T. Uribe and M. E. Stickel. Ordered Binary Decision Diagrams and the Davis-Putnam procedure. In J.-P. Jouannaud, editor, 1st International Conference on Constraints in Computational Logics, volume 845 of Lecture Notes in Computer Science, pages 34–49, Munich, 1994. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Åbo Akademi University, Lemminkäisenkatu 14a, 20520, Turku, Finland

    John Harrison

Authors
  1. John Harrison
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerhard Goos Juris Hartmanis Jan van Leeuwen Joakim von Wright Jim Grundy John Harrison

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Harrison, J. (1996). Stålmarck’s algorithm as a HOL derived rule. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1996. Lecture Notes in Computer Science, vol 1125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105407

Download citation

  • DOI: https://doi.org/10.1007/BFb0105407

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-70641-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation