{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:48:06Z","timestamp":1749124086163},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528852"},{"type":"electronic","value":"9783540471714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52885-7_77","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:45:05Z","timestamp":1330188305000},"page":"28-39","source":"Crossref","is-referenced-by-count":15,"title":["Parallelizing the closure computation in automated deduction"],"prefix":"10.1007","author":[{"given":"John K.","family":"Slaney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ewing L.","family":"Lusk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"3_CR1","unstructured":"Butler, R. M., and N. T. Karonis, \u201cExploitation of Parallelism in Prototypical Deduction Problems\u201d, Proceedings of the 9th International Conference on Automated Deduction, E. L. Lusk and R. A. Overbeek, (Eds.) Springer-Verlag Lecture Notes in Computer Science #310 (1987), pp. 333\u2013343."},{"key":"3_CR2","unstructured":"Dunn, J. M., The Algebra of Intensional Logics, doctoral dissertation (unpublished), University of Pittsburg, 1966."},{"key":"3_CR3","series-title":"Handbook of Philosophical Logic","volume-title":"Relevance Logic and Entailment","author":"J. M. Dunn","year":"1986","unstructured":"Dunn, J. M., \u201cRelevance Logic and Entailment\u201d, Gabbay, D, & G\u00fcnthner, F (eds), Handbook of Philosophical Logic, Vol. 3, Dordrecht, Reidel, 1986."},{"key":"3_CR4","unstructured":"Jindal, A., R. Overbeek, and W. Kabat, \u201cExploitation of Parallel Proceessing for Implementing High-Performance Deduction Systems\u201d, Journal of Automated Reasoning, to appear."},{"key":"3_CR5","volume-title":"Portable Programs for Parallel Processors","author":"J. Boyle","year":"1987","unstructured":"Boyle, J., Butler, R., Disz, T., Glickfeld, B., Lusk, E., Overbeek, R., Patterson, J., and Stevens, R., Portable Programs for Parallel Processors, New York, Holt, Rinehart & Winston, 1987."},{"issue":"1","key":"3_CR6","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02575007","volume":"36","author":"E. Lusk","year":"1987","unstructured":"Lusk, E. and McFadden, R., \u201cUsing Automated Reasoning Tools: A Study of the Semigroup F2B2\u201d, Semigroup Forum\n36, no. 1 (1987), pp. 75\u201388.","journal-title":"Semigroup Forum"},{"key":"3_CR7","unstructured":"McCune, W. W., \u201cOTTER 1.0 Users' Guide\u201d, Report ANL-88-44, Argonne National Laboratory, Argonne, Illinois."},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF00375901","volume":"45","author":"R. K. Meyer","year":"1986","unstructured":"Meyer, R. K., \u201cSentential Constants in R and R\u00ac\u201d, Studia Logica 45 (1986), pp. 301\u2013327.","journal-title":"Studia Logica"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"487","DOI":"10.2307\/2274237","volume":"50","author":"J. K. Slaney","year":"1984","unstructured":"Slaney, J. K., \u201c3088 Varieties: A Solution to the Ackermann Constant Problem\u201d, Journal of Symbolic Logic 50 (1984), pp. 487\u2013501.","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1305\/ndjfl\/1093634999","volume":"30","author":"J. K. Slaney","year":"1989","unstructured":"Slaney, J. K., \u201cOn the Structure of DeMorgan Monoids, With Corollaries on Relevant Logic and Theories\u201d, Notre Dame Journal of Formal Logic 30 (1989), pp. 117\u2013129.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Slaney, J. K., \u201cThe Ackermann Constant Theorem: A Computer-Assisted Investigation\u201d, Journal of Automated Reasoning, forthcoming.","DOI":"10.1007\/BF01880324"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1145\/321296.321302","volume":"14","author":"L. Wos","year":"1965","unstructured":"Wos, L., D. Carson, and G. Robinson, \u201cEfficiency and completeness of the set-of-support strategy in theorem proving,\u201d Journal of the ACM\n14, (1965), pp. 536\u2013541.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","10th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52885-7_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:09:47Z","timestamp":1619557787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52885-7_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528852","9783540471714"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-52885-7_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}