{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:02:33Z","timestamp":1648796553046},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615118","type":"print"},{"value":"9783540686873","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61511-3_106","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:51:03Z","timestamp":1330293063000},"page":"448-462","source":"Crossref","is-referenced-by-count":0,"title":["Algebra and automated deduction"],"prefix":"10.1007","author":[{"given":"Steve","family":"Linton","sequence":"first","affiliation":[]},{"given":"Ursula","family":"Martin","sequence":"additional","affiliation":[]},{"given":"P\u00e9ter","family":"Pr\u00f6hle","sequence":"additional","affiliation":[]},{"given":"Duncan","family":"Shand","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"43_CR1","unstructured":"A complete LP transcript of the session is available electronically. The files can be obtained by anonymous FTP from ftp.dcs.st-andrews.ac.uk in the directory\/pub\/Papers\/CADE13\/. The system LP can be obtained from [8]."},{"key":"43_CR2","unstructured":"Aschbacher, M.: Finite Group Theory, Cambridge Studies in Advanced Mathematics 10, Cambridge 1986."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Book, R., and Otto, F.: String Rewriting Systems, Texts and Monographs in Computer Science series, Springer Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Burris, S., Sankappanavar, H.P.: A course in universal algebra, GTM 78, Springer Verlag, 1981","DOI":"10.1007\/978-1-4613-8130-3"},{"key":"43_CR5","unstructured":"Campbell, C.: lecture notes from Computational Group Theory course, St Andrews, 1994."},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1992","unstructured":"Dershowitz, N.: Orderings for Term Rewriting Systems, Theoretical Computer Science 17, 1992, pp. 279\u2013301.","journal-title":"Theoretical Computer Science"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(91)90040-9","volume":"83","author":"N. Dershowitz","year":"1991","unstructured":"Dershowitz, N., Kaplan, S., Plaisted, D.: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite ..., Theoretical Computer Science 83, (1991), pp. 71\u201396.","journal-title":"Theoretical Computer Science"},{"key":"43_CR8","first-page":"137","volume":"355","author":"S.J. Garland","year":"1989","unstructured":"Garland, S.J., Guttag, J.V.: An Overview of LP, The Larch Prover, Proc Rewriting Techniques and Applications, 3rd Intl Conference, LNCS 355 (1989) 137\u2013151. LP can be obtained by anonymous ftp in \/pub\/Larch\/ at larch.lcs.mit.edu.","journal-title":"LNCS"},{"key":"43_CR9","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/0021-8693(79)90238-2","volume":"57","author":"Gilman","year":"1979","unstructured":"Gilman: Presentations of Groups and Monoids, Journal of Algebra 57, (1979), pp. 544\u2013554.","journal-title":"Journal of Algebra"},{"key":"43_CR10","first-page":"69","volume-title":"Computational Group Theory","author":"G. Havas","year":"1984","unstructured":"Havas, G., Kenne, P.E., Richardson, J.S. and Robertson, E.F.: A Tietze Transformation Program, (ed.) M.D. Atkinson, Computational Group Theory, Academic Press, London, 1984, pp. 69\u201373."},{"key":"43_CR11","first-page":"29","volume":"36","author":"P. Hall","year":"1933","unstructured":"Hall, P.: A contribution to the theory of groups of prime-power order, Proc. London Math. Soc. (2) 36 (1933) pp. 29\u201355.","journal-title":"Proc. London Math. Soc. (2)"},{"key":"43_CR12","volume-title":"Knuth-Bendix in Monoids, and Automatic Groups (a package of programs)","author":"D.F. Holt","year":"1995","unstructured":"Holt, D.F.: Knuth-Bendix in Monoids, and Automatic Groups (a package of programs), Mathematics Institute, University of Warwick, England, 1995. The file kbmag.tar.Z can be obtained by anonymous ftp in \/people\/dfh\/ at lomond.warwick.ac.uk. This system is also available as a GAP share package in \/pub\/incoming\/ at ftp.math.rwth-aachen.de."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Jantzen, M., Confluent String Rewriting, EATCS Monograph 14, Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-61549-8"},{"key":"43_CR14","volume-title":"Presentations of Groups","author":"D.L. Johnson","year":"1990","unstructured":"Johnson, D.L.: Presentations of Groups, Cambridge University Press, Cambridge, 1990."},{"key":"43_CR15","unstructured":"Ledermann, W.: Introduction to Group Theory, Longman 1973."},{"key":"43_CR16","unstructured":"Linton, S., and Shand, D.: Some Group Theoretic Examples with Completion Theorem Provers, to appear in Journal of Automated Reasoning."},{"key":"43_CR17","unstructured":"McKenzie, R.N., McNulty, G.F., Taylor, W.F.: Algebras, lattices, varieties, The Wadsworth and Brooks\/Cole Advanced Books and Software, 1987."},{"key":"43_CR18","unstructured":"Needham, R.E.: Infinite complete group presentations, preprint (1994), Department of Mathematics of The City College of The City University of New York."},{"key":"43_CR19","first-page":"119","volume":"80","author":"D.J.S. Robinson","year":"1982","unstructured":"Robinson, D.J.S.: A course in the Theory of Groups, GTM 80 (1982) pp. 119\u2013120.","journal-title":"GTM"},{"key":"43_CR20","unstructured":"Sch\u00f6nert, M., et. al.: GAP \u2014 Groups, Algorithms, and Programming, Lehrstuhl D f\u00fcr Mathematik, RWTH Aachen, Germany, 1992. GAP can be obtained by anonymous ftp in \/pub\/gap\/ at ftp.math.rwth-aachen.de."},{"key":"43_CR21","doi-asserted-by":"crossref","volume-title":"Computation with Finitely Presented Groups","author":"C.C. Sims","year":"1994","unstructured":"Sims, C.C.: Computation with Finitely Presented Groups, Cambridge University Press, Cambridge, 1994.","DOI":"10.1017\/CBO9780511574702"},{"key":"43_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0747-7171(87)80002-0","volume":"3","author":"C.C. Sims","year":"1987","unstructured":"Sims, C.C.: Verifying Nilpotence, Journal of Symbolic Computation 3, (1987), pp. 231\u2013247.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Automated Deduction \u2014 Cade-13","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61511-3_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:33Z","timestamp":1619573613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61511-3_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615118","9783540686873"],"references-count":22,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-61511-3_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"published":{"date-parts":[[1996]]}}}