{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:47:05Z","timestamp":1726408025229},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29007-8_19","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"330-347","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[]},{"given":"Yoshihito","family":"Toyama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"19_CR1","unstructured":"Aoto, T., Toyama, Y.: Top-down labelling and modularity of term rewriting systems. Research Report IS-RR-96-0023F, School of Information Science, JAIST (1996)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/BFb0027006","volume-title":"Algebraic and Logic Programming","author":"T Aoto","year":"1997","unstructured":"Aoto, T., Toyama, Y.: On composable properties of term rewriting systems. In: Hanus, M., Heering, J., Meinke, K. (eds.) ALP\/HOA -1997. LNCS, vol. 1298, pp. 114\u2013128. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/BFb0027006"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-02348-4_7","volume-title":"Rewriting Techniques and Applications","author":"T Aoto","year":"2009","unstructured":"Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 93\u2013102. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-02348-4_7"},{"key":"19_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","volume":"32","author":"JA Bergstra","year":"1986","unstructured":"Bergstra, J.A., Klop, J.W.: Conditional rewrite rules: confluence and termination. J. Comput. Syst. Sci. 32, 323\u2013362 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0890-5401(90)90015-A","volume":"88","author":"M Dauchet","year":"1990","unstructured":"Dauchet, M., Heuillard, T., Lescanne, P., Tison, S.: Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems. Inf. Comput. 88, 187\u2013201 (1990)","journal-title":"Inf. Comput."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2012.09.008","volume":"464","author":"B Gramlich","year":"2012","unstructured":"Gramlich, B.: Modularity in term rewriting revisited. Theor. Comput. Sci. 464, 3\u201319 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797\u2013821 (1980)","journal-title":"J. ACM"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF03037057","volume":"2","author":"J Jaffar","year":"1984","unstructured":"Jaffar, J.: Efficient unification over infinite terms. New Gener. Comput. 2, 207\u2013219 (1984)","journal-title":"New Gener. Comput."},{"key":"19_CR10","unstructured":"Kahrs, S., Smith, C.: Non-\n                      \n                        \n                      \n                      $$\\omega $$\n                    -overlapping TRSs are UN. In: Proceedings of 1st FSCD. LIPIcs, vol. 52, pp. 22:1\u201322:17. Schloss Dagstuhl (2016)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-28717-6_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D Klein","year":"2012","unstructured":"Klein, D., Hirokawa, N.: Confluence of non-left-linear TRSs via relative termination. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR 2012. LNCS, vol. 7180, pp. 258\u2013273. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-28717-6_21"},{"key":"19_CR12","unstructured":"Klop, J.: Combinatory Reduction Systems, Mathematical Centre Tracts, vol. 127. CWI, Amsterdam (1980)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-54317-1_79","volume-title":"Conditional and Typed Rewriting Systems","author":"JW Klop","year":"1991","unstructured":"Klop, J.W., de Vrijer, R.: Extended term rewriting systems. In: Kaplan, S., Okada, M. (eds.) CTRS 1990. LNCS, vol. 516, pp. 26\u201350. Springer, Heidelberg (1991). \n                      https:\/\/doi.org\/10.1007\/3-540-54317-1_79"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-63046-5_24","volume-title":"Automated Deduction \u2013 CADE 26","author":"J Nagele","year":"2017","unstructured":"Nagele, J., Felgenhauer, B., Middeldorp, A.: CSI: new evidence \u2013 a progress report. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 385\u2013397. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63046-5_24"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08531-9","volume-title":"Computing in Systems Described by Equations","year":"1977","unstructured":"O\u2019Donnell, M.J. (ed.): Computing in Systems Described by Equations. LNCS, vol. 58. Springer, Heidelberg (1977). \n                      https:\/\/doi.org\/10.1007\/3-540-08531-9"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(96)00173-9","volume":"175","author":"V Oostrom van","year":"1997","unstructured":"van Oostrom, V.: Developing developments. Theor. Comput. Sci. 175(1), 159\u2013181 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/3060144","volume":"18","author":"NR Radcliffe","year":"2017","unstructured":"Radcliffe, N.R., Moreas, L.F.T., Verma, R.M.: Uniqueness of normal forms for shallow term rewrite systems. ACM Trans. Comput. Logic 18(2), 17:1\u201317:20 (2017)","journal-title":"ACM Trans. Comput. Logic"},{"key":"19_CR18","unstructured":"Rapp, F., Middeldorp, A.: Automating the first-order theory of rewriting for left-linear right-ground rewrite systems. In: Proceedings of 1st FSCD. LIPIcs, vol. 52, pp. 36:1\u201336:17. Schloss Dagstuhl (2016)"},{"key":"19_CR19","unstructured":"Toyama, Y.: Commutativity of term rewriting systems. In: Fuchi, K., Kott, L. (eds.) Programming of Future Generation Computers II, North-Holland, pp. 393\u2013407 (1988)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-32033-3_1","volume-title":"Term Rewriting and Applications","author":"Y Toyama","year":"2005","unstructured":"Toyama, Y.: Confluent term rewriting systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, p. 1. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/978-3-540-32033-3_1\n                      \n                    . Slides at \n                      http:\/\/www.nue.ie.niigata-u.ac.jp\/toyama\/user\/toyama\/slides\/toyama-RTA05.pdf"},{"key":"19_CR21","unstructured":"Toyama, Y., Oyamaguchi, M.: Conditional linearization of non-duplicating term rewriting systems. IEICE Trans. Inf. Syst. E84-D(4), 439\u2013447 (2001)"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0019-3577(99)80012-3","volume":"10","author":"R Vrijer de","year":"1999","unstructured":"de Vrijer, R.: Conditional linearization. Indagationes Math. 10(1), 145\u2013159 (1999)","journal-title":"Indagationes Math."}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29007-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:13:32Z","timestamp":1566429212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}