{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T13:00:24Z","timestamp":1725627624569},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540168089"},{"type":"electronic","value":"9783642713859"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/978-3-642-71385-9_26","type":"book-chapter","created":{"date-parts":[[2011,11,2]],"date-time":"2011-11-02T10:20:41Z","timestamp":1320229241000},"page":"254-264","source":"Crossref","is-referenced-by-count":1,"title":["Topologische Noltisetordrungen"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"M\u00fcller","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Steinbach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"180","volume":"202","author":"N Dershowitz","year":"1985","unstructured":"Dershowitz N., Termination of Rewriting 1st. Int. Conf. on Rewriting Techniques and Application (RTA), Dijon, 1985, Springer, Berlin LNCS 202, 180\u2013224.","journal-title":"Springer, Berlin LNCS"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Dershowitz N., Manna Z., Proving Termination with Nultiset Orderings. CALM 22, 8 (Aug. 79 ); 465\u2013476.","DOI":"10.1145\/359138.359142"},{"key":"26_CR3","volume-title":"N.Y.","author":"G Huet","year":"1980","unstructured":"Huet G., Oppen D., Equations and Rewrite Rules:A Surveyin Formal Languages: Perspectives and Open Problems (R Book, ed.), Academic Press, N.Y., 1980."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Jouannaud J.P., Lescanne P., On Nultiset Orderings Information Processing Letters 15 (2) (Sept. 82 ), 57\u201363.","DOI":"10.1016\/0020-0190(82)90107-7"},{"key":"26_CR5","first-page":"432","volume-title":"Comparing and Putting together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. 8th","author":"A Pettorossi","year":"1981","unstructured":"Pettorossi A., Comparing and Putting together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems. 8th. ICALP, Haifa\/Israel, 1981, 432\u2013447."},{"key":"26_CR6","first-page":"225","volume":"202","author":"M Rusinowitch","year":"1956","unstructured":"Rusinowitch, M., Path of subterms ordering and recursive decomposition ordering revisited. RTA, Dijon 85, Springer LNCS 202, 225\u2013240","journal-title":"RTA, Dijon 85, Springer LNCS"},{"key":"26_CR7","unstructured":"Steinbach J., Ordnungen f\u00fcr Term-Ersetzungssysteme Diplomarbeit, Universit\u00e4t Kaiserslautern, PB Informatik."}],"container-title":["Informatik-Fachberichte","GWAI-86 und 2. \u00d6sterreichische Artificial-Intelligence-Tagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-71385-9_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T23:12:14Z","timestamp":1606259534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-71385-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540168089","9783642713859"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-71385-9_26","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1986]]}}}