{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:20Z","timestamp":1725663500700},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540556022"},{"type":"electronic","value":"9783540472520"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55602-8_210","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:22:12Z","timestamp":1330251732000},"page":"716-720","source":"Crossref","is-referenced-by-count":1,"title":["&: Automated natural deduction"],"prefix":"10.1007","author":[{"given":"Dave","family":"Barker-Plummer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidney C.","family":"Bailin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew S.","family":"Merrill","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"60_CR1","unstructured":"S.C. Bailin and D. Barker-Plummer. Automated Deduction in Set Theory. Technical Report NSF\/ISI-90006."},{"key":"60_CR2","doi-asserted-by":"crossref","unstructured":"S.C. Bailin. A \u03bb unifiability test for set theory. Journal of Automated Reasoning, 4(3), September 1988.","DOI":"10.1007\/BF00244943"},{"key":"60_CR3","unstructured":"S.C. Bailin and D. Barker-Plummer. Z-match: An inference rule for incrementally finding set instantiations. Submitted to the Journal of Automated Reasoning."},{"key":"60_CR4","volume-title":"Technical Report ATP104","author":"W.W. Bledsoe","year":"1990","unstructured":"W.W. Bledsoe and G. Feng. Completeness of set-var. Technical Report ATP104, University of Texas at Austin, Department of Computer Sciences, Austin, Texas, 78712, December 1990."},{"key":"60_CR5","first-page":"53","volume-title":"Machine Intelligence 9","author":"W.W. Bledsoe","year":"1979","unstructured":"W.W. Bledsoe. A maximal method for set variables in automatic theorem proving. In Machine Intelligence 9, pages 53\u2013100. Ellis Harwood, Ltd., Chichester, 1979."},{"key":"60_CR6","unstructured":"W.W. Bledsoe and M. Tyson. The Ut interactive prover. Memo ATP-17, Mathematics Department, University of Texas, May 1975."},{"key":"60_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G.P. Huet","year":"1974","unstructured":"G.P. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science 1, pages 27\u201357, 1974.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-11"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55602-8_210.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:02Z","timestamp":1619573582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55602-8_210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540556022","9783540472520"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-55602-8_210","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}