{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:40Z","timestamp":1725663520035},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563938"},{"type":"electronic","value":"9783540475491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_40","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:30Z","timestamp":1330254510000},"page":"498-501","source":"Crossref","is-referenced-by-count":0,"title":["Set-of-support strategy for higher-order logic"],"prefix":"10.1007","author":[{"given":"Wenchang","family":"Fang","sequence":"first","affiliation":[]},{"given":"Jung-Hong","family":"Kao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","volume":"5","author":"A. Church","year":"1940","unstructured":"Church A. A formulation of the simple theory of types. Journal of symbolic logic, 5:56\u201368, 1940.","journal-title":"Journal of symbolic logic"},{"issue":"3","key":"40_CR2","doi-asserted-by":"crossref","first-page":"414","DOI":"10.2307\/2269949","volume":"36","author":"B. A. Peter","year":"1971","unstructured":"Peter B. Andrews. Resolution in type theory. Journal of Symbolic logic, 36(3):414\u2013432, sept 1971.","journal-title":"Journal of Symbolic logic"},{"key":"40_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1090\/conm\/029\/09","volume":"29","author":"B. A. Peter","year":"1984","unstructured":"Peter B. Andrews, D. Miller, E. Cohen, and F. Pfenning. Automating higher-order logic. In Conlemptary Mathematics 29, pages 169\u2013192, 1984.","journal-title":"Conlemptary Mathematics"},{"key":"40_CR4","unstructured":"J. L. Darlington. A partial mechanization of second-order logic. In B. Meltser and D Michie, editors, Machine Intelligence 6, pages 91\u2013100. American Elsevier Publishing Co., 1971."},{"key":"40_CR5","unstructured":"Wenchang Fang and Lawrence Ilenschen. Some heuristics for higher-order logic. In Golden West International Conference on Intelligent System, 1992."},{"key":"40_CR6","volume-title":"PhD thesis","author":"J. I. Lawrence","year":"1971","unstructured":"Lawrence J. Ilenschen. A resolution style proof procedure for higher-order logic. PhD thesis, University of Illinois at Urbana-Champaign, 1971."},{"key":"40_CR7","unstructured":"G. P. Huet. Constrained Resolution: A Complete Method For Higher order Logic. PhD thesis, Case Western reserve University, 1972."},{"key":"40_CR8","unstructured":"G. P. Huet. A mechanization of type theory. In Proceedings of the third IJCAI, pages 139\u2013146, 1973."},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"G. P. Huet. A unification algorithm for typed lambda-calculus. Theoretical Computer Science, pages 27\u201357, 1975.","DOI":"10.1016\/0304-3975(75)90011-0"}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:50:27Z","timestamp":1619571027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}