{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:48:10Z","timestamp":1749124090577},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614647"},{"type":"electronic","value":"9783540685968"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61464-8_39","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:40:28Z","timestamp":1330292428000},"page":"3-17","source":"Crossref","is-referenced-by-count":7,"title":["Fine-grained concurrent completion"],"prefix":"10.1007","author":[{"given":"Claude","family":"Kirchner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christelle","family":"Scharff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"2_CR1","first-page":"397","volume-title":"LNCS 914","author":"J. Avenhaus","year":"1995","unstructured":"J. Avenhaus, J. Denzinger, and M. Fuchs. DISCOUNT: A system for distributed equational deduction. In Hsiang [Hsi95], pages 397\u2013402."},{"key":"2_CR2","first-page":"408","volume-title":"LNCS 914","author":"R. B\u00fcndgen","year":"1995","unstructured":"R. B\u00fcndgen, M. G\u00f6bel, and W. K\u00fcchlin. Parallel ReDuX \u2192 PaReDuX. In Hsiang [Hsi95], pages 408\u2013413."},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00881910","volume":"13","author":"M. P. Bonacina","year":"1994","unstructured":"M. P. Bonacina and J. Hsiang. Parallelization of deduction strategies: an analytical study. Journal of Automated Reasoning, 13:1\u201333, 1994.","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1006\/jsco.1995.1014","volume":"19","author":"M. P. Bonacina","year":"1995","unstructured":"M. P. Bonacina and J. Hsiang. Distributed deduction by clause-diffusion: Distributed contraction and the aquarius prover. Journal of Symbolic Computation, 19:245\u2013267, March 1995.","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0020-0190(83)90092-3","volume":"16","author":"E. Dijkstra","year":"1983","unstructured":"E. Dijkstra, W. Feijen, and A. van Gasteren. Derivation of a termination detection algorithm for distributed computation. Information Processing Letters, 16:217\u2013219, 1983.","journal-title":"Information Processing Letters"},{"key":"2_CR6","first-page":"244","volume-title":"volume B, chapter 6: Rewrite Systems","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pages 244\u2013320. Elsevier Science Publishers B. V. (North-Holland), 1990. Also as: Research report 478, LRI."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"C. Dwork, P. Kanellakis, and J. C. Mitchell. On the sequential nature of unification. Journal of Logic Programming, 1(1):35\u201350, 1984.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"2_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/138027.138032","volume":"40","author":"J. Gallier","year":"1993","unstructured":"J. Gallier, P. Narandran, D. Plaisted, S. Raatz, and W. Snyder. Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time. Journal of Association for Computing Machinery, 40(1):1\u201316, 1993.","journal-title":"Journal of Association for Computing Machinery"},{"volume-title":"LNCS 914","year":"1995","key":"2_CR9","unstructured":"J. Hsiang, editor. Rewriting Techniques and Applications, 6th International Conference, RTA-95, LNCS 914, Kaiserslautern, Germany, April 5\u20137, 1995. Springer-Verlag."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"C. Kirchner, C. Lynch, and C. Scharff. Fine-grained concurrent completion. Technical Report 96-R-058, CRIN, 1996.","DOI":"10.1007\/3-540-61464-8_39"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"R. Letz and J. Schumann. Partheo: A high-performance parallel theorem prover. In Proceedings 10th International Conference on Automated Deduction, Kaiserslautern (Germany), volume 446 of Lecture Notes in Artificial Intelligence, pages 40\u201356. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52885-7_78"},{"key":"2_CR12","unstructured":"C. Lynch and P. Strogova. Sour graphs for efficient completion. Technical Report 95-R-343, CRIN, 1995."},{"key":"2_CR13","first-page":"167","volume-title":"Paramodulation without duplication","author":"C. Lynch","year":"1995","unstructured":"C. Lynch. Paramodulation without duplication. In D. Kozen, editor, Proceedings 10th IEEE Symposium on Logic in Computer Science, San Diego (Ca., USA), pages 167\u2013177, San Diego, June 1995. IEEE."},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1006\/jsco.1993.1029","volume":"15","author":"W. Snyder","year":"1993","unstructured":"W. Snyder. A fast algorithm for generating reduced ground rewriting systems from a set of ground equations. Journal of Symbolic Computation, 15:415\u2013450, 1993.","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR15","unstructured":"C. Suttner and J. Schumann. Parallel automated theorem proving. Parallel Processing for Artificial Intelligence, 1993."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61464-8_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:06:27Z","timestamp":1605647187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61464-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614647","9783540685968"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61464-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}