Stålmarck’s algorithm as a HOL derived rule

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1125, Issue , 1996, Pages 221-234

  Harrison, John ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC;

INDUSTRIAL SCALE; S-ALGORITHMS;

THEOREM PROVING;

EID: 84956862996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0105407     Document Type: Conference Paper

References (17)

1. P. Bernays and M. Schonfinkel. Zum Entscheidungsproblem der mathematischen Logik. Mathematische Annalen, 99:401-419,1928.
2. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691,1986.
3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24:293-318,1992.
4. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings ofthe 3rd ACM Symposium on the Theory of Computing, pages 151-158,1971.
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.
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.
7. J. F. Groote. Hiding propositional constants in BDDs. Formal Methods in System Design, 8:91-96,1996.
8. J. Harrison. Binary decision diagrams as a HOL derived rule. The Computer Journal, 38:162-170,1995.
9. J. N. Hooker. A quantitative approach to logical inference. Decision Support Systems, A A5-69, 1988.
10. R. G. Jereslow. Computation-oriented reductions of predicate to propositional logic. Decision Support Systems, 4:183-197,1988.
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 Street, Glasgow G2 8EX, UK, 1991.
12. M. Saflund. Modelling and formally verifying systems and software in industrial applications. Unpublished; available from the National Physical Laboratory, Teddington, Middlesex, TW11 0LW, UK, 1994.
13. G. Stalmarck. A proof theoretic concept of tautological hardness. Unpublished manuscript, 1994.
14. G. Stalmarck. 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.
15. G. Stalmarck and M. Saflund. Modeling and verifying systems and software in propositional logic. InB. K. Daniels, editor, Safety of Computer Control Systems, 1990 (SAFECOMP '90), pages 31-36, Gatwick, UK, 1990. Pergamon Press.
16. C. B. Suttner and G. Sutcliffe. The TPTP problem library. Technical Report AR-95-03, Institut fur Infomatik, TU Munchen, Germany, 1995. Also available as TR 95/6 from Dept. Computer Science, James Cook University, Australia, and on the Web.
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.