{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:03Z","timestamp":1725663843184},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581567"},{"type":"electronic","value":"9783540484677"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58156-1_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:22:31Z","timestamp":1330251751000},"page":"432-434","source":"Crossref","is-referenced-by-count":0,"title":["Termination, geometry and invariants"],"prefix":"10.1007","author":[{"given":"Ursula","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"31_CR1","unstructured":"E A Cichon, Bounds on Derivation Lengths from Termination Proofs, International Journal of Foundations of Computer Science, to appear."},{"key":"31_CR2","unstructured":"J Davenport, Y Siret and E Tournier, Computer Algebra, Academic Press 1988"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"D De Schreye and Kristof Verschaetse, Tutorial on termination of logic programs, in Springer Lecture Notes in Computer Science 649, Meta-Programming in Logic, 1992","DOI":"10.1007\/3-540-56282-6_5"},{"key":"31_CR4","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, Journal of Symbolic Computation 3 (1987) 69\u2013116","journal-title":"Journal of Symbolic Computation"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"J H Gallier, What's so special about Kruskal's theorem and the ordinal \u03b30? A survey of some results on Proof theory, Annals of Pure and Applied Logic 53 (1991)","DOI":"10.1016\/0168-0072(91)90022-E"},{"key":"31_CR6","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":"31_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(89)90020-0","volume":"67","author":"U. Martin","year":"1989","unstructured":"U. Martin, A geometrical approach to multiset orderings, Theoretical computer Science 67 (1989) 37\u201354","journal-title":"Theoretical computer Science"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"U Martin, Linear interpretations by counting patterns, in Springer Lecture Notes in Computer Science 690, 5th International Conference on Rewriting Techniques and Applications, Montreal, June 1993","DOI":"10.1007\/3-540-56868-9_31"},{"key":"31_CR9","doi-asserted-by":"crossref","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, Journal of Symbolic Computation (1992) 13, 81\u2013100","journal-title":"Journal of Symbolic Computation"},{"key":"31_CR10","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","DOI":"10.1109\/LICS.1993.287573"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"W W McCune, OTTER 2.0, in Proceedings of the 10th International conference on Computer Aided Deduction, Lecture Notes in Computer Science, Springer Verlag, 1990","DOI":"10.1007\/3-540-52885-7_131"},{"key":"31_CR12","volume-title":"Words, Languages and Combinatorics","author":"T Saito","year":"1992","unstructured":"T Saito, M Katsura, Y Kobayashi and K Kajitori, On Totally Ordered Free Monoids, in Words, Languages and Combinatorics, World Scientific Publishing Co, Singapore 1992"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"E A Scott, Weights for total division orderings on strings, to appear, Theoretical Computer Science 1994.","DOI":"10.1016\/0304-3975(94)90111-2"},{"key":"31_CR14","unstructured":"J Steinbach, Simplification orderings-history of results, to appear Fundamentae Informaticae, 1994."},{"key":"31_CR15","unstructured":"A M Turing, Checking a large routine, in: Report of a Conference on High Speed Automatic Calculating Machines, Univ Math Lab Cambridge, 1949, 67\u201369"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-12"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58156-1_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:17:37Z","timestamp":1605629857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58156-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581567","9783540484677"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-58156-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}