{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T18:28:36Z","timestamp":1772648916041,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Automated Reasoning"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1006370506164","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T01:36:27Z","timestamp":1040520987000},"page":"145-163","source":"Crossref","is-referenced-by-count":36,"title":["Proving Consistency Assertions for Automotive Product Data Management"],"prefix":"10.1007","volume":"24","author":[{"given":"Wolfgang","family":"K\u00fcchlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carsten","family":"Sinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"255309_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C-27","author":"S. B. Akers","year":"1978","unstructured":"Akers, S. B.: Binary decision diagrams, IEEE Trans. Comput.\nC-27(6) (1978), 509\u2013516.","journal-title":"IEEE Trans. Comput."},{"key":"255309_CR2","unstructured":"Bayardo, R. J., Jr. and Schrag, R. C.: Using CSP look-back techniques to solve real-world SAT instances, in Proceedings of the 14th National Conference on Artificial Intelligence (AAAI'97), AAAI Press, 1997, pp. 203\u2013208."},{"key":"255309_CR3","doi-asserted-by":"crossref","unstructured":"Bor\u00e4lv, A.: The industrial success of verification tools based on St\u00e5 lmarck's method, in O. Grumberg (ed.), Computer Aided Verification, Lecture Notes in Comput. Sci. 1254, Springer-Verlag, 1997, pp. 7\u201310.","DOI":"10.1007\/3-540-63166-6_3"},{"key":"255309_CR4","doi-asserted-by":"crossref","unstructured":"Bowen, J. P. and Hinchey, M. G.: Seven more myths of formal methods: Dispelling industrial prejudices, in M. Naftalin, T. Denvir, and M. Bertran (eds.), FME'94: Industrial Benefit of Formal Methods, Lecture Notes in Comput. Sci. 873, Springer-Verlag, 1994, pp. 105\u2013117.","DOI":"10.1007\/3-540-58555-9_91"},{"issue":"8","key":"255309_CR5","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R. E. Bryant","year":"1986","unstructured":"Bryant, R. E.: Graph-based algorithms for boolean function manipulation, IEEE Trans. Comput.\nC-35(8) (1986), 677\u2013691.","journal-title":"IEEE Trans. Comput."},{"key":"255309_CR6","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., and Loveland, D.: A machine program for theorem-proving, Comm. ACM\n5 (1962), 394\u2013397.","journal-title":"Comm. ACM"},{"key":"255309_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M. and Putnam, H.: A computing procedure for quantification theory, J. ACM\n7 (1960), 201\u2013215.","journal-title":"J. ACM"},{"key":"255309_CR8","doi-asserted-by":"crossref","unstructured":"Dershowitz, N. and Jouannaud, J.-P.: Rewrite systems, in Formal Models and Semantics, Vol. 2 of Handbook of Theoretical Computer Science, Chapter 6, Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"255309_CR9","volume-title":"Improvements to propositional satisfiability search algorithms","author":"J. W. Freeman","year":"1995","unstructured":"Freeman, J. W.: Improvements to propositional satisfiability search algorithms, PhD Thesis, University of Pennsylvania, Philadelphia, Pennsylvania, May 1995."},{"key":"255309_CR10","series-title":"Technical Report 97\u201350, RISC-Linz Report Series","volume-title":"Structured formal verification of a fragment of the IBM 390 Clock Chip","author":"A. Geser","year":"1997","unstructured":"Geser, A. and K\u00fcchlin, W.: Structured formal verification of a fragment of the IBM 390 Clock Chip, Technical Report 97\u201350, RISC-Linz Report Series, Schlo\u00df Hagenberg bei Linz, Austria, Oct. 1997."},{"key":"255309_CR11","volume-title":"Topics in automated theorem proving and program generation","author":"J. Hsiang","year":"1982","unstructured":"Hsiang, J.: Topics in automated theorem proving and program generation, PhD Thesis, University of Illinois, Urbana, Illinois, Dec. 1982."},{"key":"255309_CR12","doi-asserted-by":"crossref","unstructured":"Marschner, F. E.: Practical challenges for industrial formal verification tools, in O. Grumberg (ed.), Computer Aided Verification, Lecture Notes in Comput. Sci. 1254, Springer-Verlag, 1997, pp. 1\u20132.","DOI":"10.1007\/3-540-63166-6_1"},{"key":"255309_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K. L. McMillan","year":"1993","unstructured":"McMillan, K. L.: Symbolic Model Checking, Kluwer Academic Publishers, Boston, 1993."},{"key":"255309_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. H. A. Newman","year":"1942","unstructured":"Newman, M. H. A.: On theories with a combinatorial definition of \u201cequivalence\u201d, in Annals of Mathematics, Vol. 43, Princeton University Press, 1942, pp. 223\u2013243.","journal-title":"Annals of Mathematics"},{"key":"255309_CR15","doi-asserted-by":"crossref","unstructured":"Pugliese, R. and Tronci, E.: Automatic verification of a hydroelectric power plant, in M.-C. Gaudel and J. Woodcock (eds.), FME'96: Industrial Benefit and Advances in Formal Methods, Lecture Notes in Comput. Sci. 1051, Springer-Verlag, 1996, pp. 425\u2013444.","DOI":"10.1007\/3-540-60973-3_100"},{"key":"255309_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"Robinson, J. A.: A machine-oriented logic based on the resolution principle, in J. ACM\n12 (1965), 23\u201341.","journal-title":"J. ACM"},{"key":"255309_CR17","doi-asserted-by":"crossref","unstructured":"Saiedian, H.: An invitation to formal methods, in E. A. Parrish (ed.), Computer, Vol. 29, IEEE Computer Society, Apr. 1996, pp. 16\u201330.","DOI":"10.1109\/MC.1996.488298"},{"key":"255309_CR18","doi-asserted-by":"crossref","unstructured":"Tseitin, G. S.: On the complexity of derivation in propositional calculus, in A. O. Silenko (ed.), Studies in Constructive Mathematics and Mathematical Logic, 1970, pp. 115\u2013125.","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"255309_CR19","doi-asserted-by":"crossref","unstructured":"Turk, A. L., Probst, S. T., and Powers, G. J.: Verification of a chemical process leak test procedure, in O. Grumberg (ed.), Computer Aided Verification, Lecture Notes in Comput. Sci. 1254, Springer-Verlag, 1997, pp. 84\u201394.","DOI":"10.1007\/3-540-63166-6_11"},{"key":"255309_CR20","first-page":"1","volume":"22","author":"H. Zhang","year":"1993","unstructured":"Zhang, H.: SATO: A decision procedure for propositional logic, in Association for Automated Reasoning Newsletter, Vol. 22, March 1993, pp. 1\u20133.","journal-title":"Association for Automated Reasoning Newsletter"},{"key":"255309_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, H.: SATO: An efficient propositional prover, in CADE'97: 14th International Conference on Automated Deduction, Lecture Notes in Comput. Sci. 1249, Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63104-6_28"},{"key":"255309_CR22","series-title":"Technical report","volume-title":"Implementing the Davis-Putnam algorithm by tries","author":"H. Zhang","year":"1994","unstructured":"Zhang, H. and Stickel, M.: Implementing the Davis-Putnam algorithm by tries, Technical report, Department of Computer Science, The University of Iowa, Iowa City, IA, Aug. 1994."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006370506164.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006370506164\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006370506164.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:27:09Z","timestamp":1749122829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006370506164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["255309"],"URL":"https:\/\/doi.org\/10.1023\/a:1006370506164","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}