{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:52:48Z","timestamp":1762458768071},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/bf03177742","type":"journal-article","created":{"date-parts":[[2009,12,5]],"date-time":"2009-12-05T06:04:31Z","timestamp":1259993071000},"page":"287-313","source":"Crossref","is-referenced-by-count":8,"title":["Formal verification of a generic framework to synthesize SAT-provers"],"prefix":"10.1007","volume":"32","author":[{"given":"Francisco -Jes\u00fas","family":"Mart\u00edn-Mateos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 -Antonio","family":"Alonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda -Jos\u00e9","family":"Hidalgo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 -Luis","family":"Ruiz-Reina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF03177742_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Ari, M:Mathematical Logic for Computer Science, Springer-Verlag, 2001.","DOI":"10.1007\/978-1-4471-0335-6"},{"key":"BF03177742_CR2","unstructured":"Boyer, R. S. and Moore, J S.:A Computational Logic, Academic Press, 1979."},{"key":"BF03177742_CR3","doi-asserted-by":"crossref","unstructured":"Boyer, R. S. and Moore, J S.: Single-threaded objects in ACL2, inPractical Aspects of Declarative Languages, LNCS 2257, Springer-Verlag, 2002, pp. 9\u201327.","DOI":"10.1007\/3-540-45587-6_3"},{"key":"BF03177742_CR4","doi-asserted-by":"crossref","unstructured":"Caldwell, J.: Classical prepositional decidability via Nuprl proof extraction, inProceedings of the 11th International Conference on Theorem Proving in Higher Order Logics (TPHOLs \u203298), LNCS 1479, Springer-Verlag, 1998, pp. 105\u2013122.","DOI":"10.1007\/BFb0055132"},{"issue":"3","key":"BF03177742_CR5","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. Assoc. Comput. Much. 7(3) (1960), 201\u2013215.","journal-title":"J. Assoc. Comput. Much."},{"issue":"7","key":"BF03177742_CR6","first-page":"394","volume":"5","author":"M. Davis","year":"962","unstructured":"Davis, M., Logemann, G. and Loveland, D.: A machine program for theorem-proving,Comm. Assoc. Comput. Much. 5(7) (1962), 394\u2013397.","journal-title":"Comm. Assoc. Comput. Much."},{"key":"BF03177742_CR7","doi-asserted-by":"crossref","unstructured":"Dershowitz, N. and Manna, Z.: Proving termination with multiset orderings, inProceedings of the Sixth International Colloquium on Automata, Languages and Programming, LNCS 71, Springer-Verlag, 1979, pp. 188\u2013202.","DOI":"10.1007\/3-540-09510-1_15"},{"key":"BF03177742_CR8","doi-asserted-by":"crossref","unstructured":"Fitting, M. C:First-Order Logic and Automated Theorem Proving, Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4612-2360-3"},{"key":"BF03177742_CR9","doi-asserted-by":"crossref","unstructured":"Gu, J., Purdom, P. W., Franco, J. and Wah, B. W.: Algorithms for the satisfiability (SAT) problem: A survey, inSatisfiability Problem: Theory and Applications, DIMACS: Series in Descrete and Applied Mathematics and Computer Science 35, Amer. Math. Soc, 1997.","DOI":"10.1090\/dimacs\/035\/02"},{"key":"BF03177742_CR10","unstructured":"Gallier, J. H.:Logic for Computer Science, Foundations of Automatic Theorem Proving, Harper and Row Publishers, 1986."},{"key":"BF03177742_CR11","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Manolios, P. and Moore, J S.:Computer-Aided Reasoning: An Approach, Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4615-4449-4"},{"key":"BF03177742_CR12","unstructured":"Kaufmann, M. and Moore, J S.:ACL2 Version 2.7, 2001. Homepage: http:\/\/www.es. utexas.edu\/users\/moore\/acl2\/"},{"issue":"2","key":"BF03177742_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1026517200045","volume":"26","author":"M. Kaufmann","year":"2001","unstructured":"Kaufmann, M. and Moore, J S.: Structured theory development for a mechanized logic,J. Automated Reasoning 26(2) (2001), 161\u2013203.","journal-title":"J. Automated Reasoning"},{"key":"BF03177742_CR14","unstructured":"Martin-Mateos, F. J., Alonso, J. A., Hidalgo, M. J. and Ruiz-Reina, J. L.: A generic instantiation tool and a case study: A generic multiset theory. Presented at 3rd Intl. Workshop on the ACL2 Theorem Prover and Its Applications, Grenoble, 2002."},{"key":"BF03177742_CR15","doi-asserted-by":"crossref","unstructured":"Martin-Mateos, F. J., Alonso, J. A., Hidalgo, M. J. and Ruiz-Reina, J. L.: Verification in ACL2 of a generic framework to synthesize SAT-provers, inLogic Based Program Synthesis and Tranformation, LNCS 2664, Springer-Verlag, 2003.","DOI":"10.1007\/3-540-45013-0_15"},{"key":"BF03177742_CR16","unstructured":"Martin-Mateos, F. J., Alonso, J. A., Hidalgo, M. J. and Ruiz-Reina, J. L.: A generic framework for SAT-provers (formalization in ACL2). http: \/ \/www. cs .us. es\/clg\/theories\/ acl2\/gen-sat"},{"key":"BF03177742_CR17","doi-asserted-by":"crossref","unstructured":"Ruiz-Reina, J. L., Alonso, J. A., Hidalgo, M. J. and Martin, F. J.: Termination in ACL2 using multiset relation, inThirty Five Years of Automating Mathematics, Applied Logic Series 28, Kluwer Academic Publishers, 2003.","DOI":"10.1007\/978-94-017-0253-9_9"},{"key":"BF03177742_CR18","doi-asserted-by":"crossref","unstructured":"Shankar, N.: Little engines of proof, inFME 2002: Formal Methods \u2014 Getting IT Right, LNCS 2391, Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45614-7_1"},{"key":"BF03177742_CR19","doi-asserted-by":"crossref","unstructured":"Smullyan, R. M.:First-Order Logic, Springer-Verlag, 1968.","DOI":"10.1007\/978-3-642-86718-7"},{"issue":"1\u20132","key":"BF03177742_CR20","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1006351428454","volume":"24","author":"H. Zhang","year":"2000","unstructured":"Zhang, H. and Stickel, M. E.: Implementing the Davis-Putnam method,J. Automated Reasoning 24(1\u20132) (2000), 277\u2013296.","journal-title":"J. Automated Reasoning"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03177742.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03177742\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03177742","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:10:46Z","timestamp":1558685446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03177742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["BF03177742"],"URL":"https:\/\/doi.org\/10.1007\/bf03177742","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}