{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:42Z","timestamp":1725664182275},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615118"},{"type":"electronic","value":"9783540686873"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61511-3_100","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:50:23Z","timestamp":1330293023000},"page":"358-372","source":"Crossref","is-referenced-by-count":2,"title":["Theorem proving with group presentations: Examples and questions"],"prefix":"10.1007","author":[{"given":"Ursula","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ronald V Book and Friedrich Otto, String-rewriting systems, Springer Verlag Texts and Monographs in Computer Science, New York 1993","key":"37_CR1","DOI":"10.1007\/978-1-4613-9771-7_3"},{"unstructured":"W Bosma and J Cannon, Handbook of MAGMA functions, Department of Pure Mathematics, University of Sydney 1993","key":"37_CR2"},{"doi-asserted-by":"crossref","unstructured":"E A Cichon and P Lescanne, Polynomial Interpretations and the Complexity of Algorithms, in Proceedings of the 11th International Conference on Computer Aided Deduction, Lecture Notes in Computer Science 607, Springer Verlag, 1992","key":"37_CR3","DOI":"10.1007\/3-540-55602-8_161"},{"unstructured":"J. Conway et al, The Atlas of Finite Simple groups, Oxford University Press, 1987","key":"37_CR4"},{"key":"37_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz, Termination of Rewriting, J. Symbolic Computation, 3 (1987) 69\u2013116","journal-title":"J. Symbolic Computation"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz, Orderings for term rewriting systems, Theoretical Computer Science 17 (1982) 279\u2013301","journal-title":"Theoretical Computer Science"},{"key":"37_CR7","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/S0747-7171(08)80093-4","volume":"12","author":"D. B. A. Epstein","year":"1991","unstructured":"D. B. A. Epstein, D. F. Holt and S. E. Rees, The use of Knuth-Bendix methods to solve the word problem in automatic groups, J. Symbolic Computation 12 (1991) 397\u2013414","journal-title":"J. Symbolic Computation"},{"key":"37_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/jsco.1993.1051","volume":"16","author":"D Faugere","year":"1993","unstructured":"D Faugere et al, Efficient computation of zero dimensional Grobner bases by change of ordering, J. Symbolic Computation 16 (1993) 329\u2013344","journal-title":"J. Symbolic Computation"},{"key":"37_CR9","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1017\/S0013091500018381","volume":"36","author":"J. R. J. Groves","year":"1993","unstructured":"J R J Groves and G C Smith, Soluble Groups with a Finite Rewriting System, Proc. Edin. Math. Soc. 36 (1993), 283\u2013288","journal-title":"Proc. Edin. Math. Soc."},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF00881714","volume":"14","author":"J Hart","year":"1995","unstructured":"J Hart and K Kunen, Single axioms for odd exponent groups, J. Automated Reasoning 14 (1995) 383\u2013412","journal-title":"J. Automated Reasoning"},{"unstructured":"S M Hermiller and John Meier, Tame combings, almost convexity and rewriting systems for groups, To appear, Math Z.","key":"37_CR11"},{"unstructured":"D. Knuth and P. Bendix, Simple Word Problems in Universal Algebras, in Computational Problems in Abstract Algebra, Pergamon Press 1970, ed J. Leech.","key":"37_CR12"},{"key":"37_CR13","volume-title":"Canonical forms in finitely presented algebras","author":"P Chenadec Le","year":"1986","unstructured":"P Le Chenadec, Canonical forms in finitely presented algebras, Pitman, New York 1986"},{"doi-asserted-by":"crossref","unstructured":"S Linton and D D Shand, Some group theoretic examples with completion theorem provers, J. Automated Reasoning, to appear","key":"37_CR14","DOI":"10.1007\/BF00244494"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0304-3975(89)90002-9","volume":"67","author":"K Madlener","year":"1989","unstructured":"K Madlener and F Otto, About the descriptive power of certain classes of finite string rewriting systems, Theoretical Computer Science 67 (1989), 143\u2013172","journal-title":"Theoretical Computer Science"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/jsco.1993.1040","volume":"16","author":"K Madlener","year":"1993","unstructured":"K Madlener et al, On the problem of generating small convergent systems, J. Symbolic Computation 16 (1993) 167\u2013188","journal-title":"J. Symbolic Computation"},{"doi-asserted-by":"crossref","unstructured":"U. Martin, Linear interpretations by counting patterns, in Proceedings 5th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 690, Springer Verlag, 1993","key":"37_CR17","DOI":"10.1007\/3-540-56868-9_31"},{"unstructured":"Ursula Martin, On the diversity of orderings on strings, Fundamentae Informaticae, to appear.","key":"37_CR18"},{"unstructured":"Ursula Martin, Termination invariants for string rewriting systems, University of St Andrews Research Report CS\/94\/15","key":"37_CR19"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0747-7171(92)90007-Q","volume":"13","author":"U Martin","year":"1992","unstructured":"U Martin and M F K Lai, Some experiments with a completion theorem prover, J. Symbolic Computation (1992) 13, 81\u2013100","journal-title":"J. Symbolic Computation"},{"doi-asserted-by":"crossref","unstructured":"Ursula Martin and Elizabeth Scott, The order types of termination orderings on terms, strings and multisets, in Proceedings of the Eighth IEEE Conference on Logic in Computer Science, Montreal, 1993","key":"37_CR21","DOI":"10.1109\/LICS.1993.287573"},{"key":"37_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0747-7171(88)80042-7","volume":"6","author":"T Mora","year":"1988","unstructured":"T Mora and L Robbiano, The Groebner fan of an ideal, J. Symbolic Computation 6 (1988) 183\u2013208","journal-title":"J. Symbolic Computation"},{"unstructured":"T Mora, Grobner bases for non-commutative polynomial rings, Proc AAECC 3, Lecture Notes in Computer Science 229, 413\u2013421, Springer Verlag, 1986","key":"37_CR23"},{"doi-asserted-by":"crossref","unstructured":"D Plaisted, Equational reasoning and term rewriting systems, in Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, 274\u2013367, 1993","key":"37_CR24","DOI":"10.1093\/oso\/9780198537458.003.0005"},{"unstructured":"M Sch\u00f6nert et al, GAP-Groups Algorithms and Programming, Lehrstuhl D f\u00fcr Mathematik, RWTH Aachen 1993","key":"37_CR25"},{"unstructured":"E. Scott, Division orderings given by matrices, Technical Report RHUL 1993","key":"37_CR26"},{"key":"37_CR27","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(94)90111-2","volume":"135","author":"E. A. Scott","year":"1994","unstructured":"E. A. Scott, Weights for total division orderings on strings, Theoretical Computer Science 135 (1994) 345\u2013359","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"C C Sims, Computation with finitely presented groups, Cambridge University Press 1994","key":"37_CR28","DOI":"10.1017\/CBO9780511574702"},{"key":"37_CR29","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0022-4049(87)90129-0","volume":"49","author":"C Squier","year":"1987","unstructured":"C Squier, Word problems and a homological finiteness condition for monoids, J. Pure and Applied Algebra 49 (1987), 13\u201322","journal-title":"J. Pure and Applied Algebra"},{"unstructured":"J Steinbach, Simplification orderings, Fundamentae Informaticae, to appear.","key":"37_CR30"},{"key":"37_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF00244488","volume":"6","author":"Y Yu","year":"1990","unstructured":"Y Yu, Computer proofs in group theory, J. Automated Reasoning 6 (1990) 251\u2013286","journal-title":"J. Automated Reasoning"},{"doi-asserted-by":"crossref","unstructured":"H Zantema and A Geser, A complete characterisation of termination of 0p1q \u2192 1r0s, Proceedings 6th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 914, Springer Verlag, 1995","key":"37_CR32","DOI":"10.1007\/3-540-59200-8_46"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 Cade-13"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61511-3_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:32:19Z","timestamp":1713634339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61511-3_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615118","9783540686873"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-61511-3_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}