{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:40:14Z","timestamp":1758044414875,"version":"3.44.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032048479","type":"print"},{"value":"9783032048486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04848-6_12","type":"book-chapter","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:59:50Z","timestamp":1757678390000},"page":"180-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Characterizing Equivalence of\u00a0Logically Constrained Terms via\u00a0Existentially Constrained Terms"],"prefix":"10.1007","author":[{"given":"Kanta","family":"Takahata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5908-8519","authenticated-orcid":false,"given":"Jonas","family":"Sch\u00f6pf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8697-4970","authenticated-orcid":false,"given":"Naoki","family":"Nishida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0027-0759","authenticated-orcid":false,"given":"Takahito","family":"Aoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Aoto, T., Nishida, N., Sch\u00f6pf, J.: Equational theories and validity for logically constrained term rewriting. In: Rehof, J. (ed.) Proceedings of the 9th FSCD. LIPIcs, vol.\u00a0299, pp. 31:1\u201331:21 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2024.31","DOI":"10.4230\/LIPIcs.FSCD.2024.31"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998). https:\/\/doi.org\/10.1145\/505863.505888","DOI":"10.1145\/505863.505888"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Fuhs, C., Kop, C., Nishida, N.: Verifying procedural programs via constrained rewriting induction. ACM Trans. Comput. Log. 18(2), 14:1\u201314:50 (2017). https:\/\/doi.org\/10.1145\/3060143","DOI":"10.1145\/3060143"},{"key":"12_CR4","unstructured":"Kojima, M., Nishida, N.: On representations of waiting queues for semaphores in logically constrained term rewrite systems with constant destinations. J. Inf. Process. (2024). to appear"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Kop, C.: Termination of LCTRSs. CoRR abs\/1601.03206 (2016). https:\/\/doi.org\/10.48550\/ARXIV.1601.03206","DOI":"10.48550\/ARXIV.1601.03206"},{"key":"12_CR6","unstructured":"Kop, C.: Quasi-reductivity of logically constrained term rewriting systems. CoRR abs\/1702.02397 (2017). http:\/\/arxiv.org\/abs\/1702.02397"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-642-40885-4_24","volume-title":"Frontiers of Combining Systems","author":"C Kop","year":"2013","unstructured":"Kop, C., Nishida, N.: Term rewriting with logical constraints. In: Fontaine, P., Ringeissen, C., Schmidt, R.A. (eds.) FroCoS 2013. LNCS (LNAI), vol. 8152, pp. 343\u2013358. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40885-4_24"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-319-12736-1_18","volume-title":"Programming Languages and Systems","author":"C Kop","year":"2014","unstructured":"Kop, C., Nishida, N.: Automatic constrained rewriting induction towards verifying procedural programs. In: Garrigue, J. (ed.) APLAS 2014. LNCS, vol. 8858, pp. 334\u2013353. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12736-1_18"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-03592-1_18","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"N Nishida","year":"2018","unstructured":"Nishida, N., Winkler, S.: Loop detection by logically constrained term rewriting. In: Piskac, R., R\u00fcmmer, P. (eds.) VSTTE 2018. LNCS, vol. 11294, pp. 309\u2013321. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03592-1_18"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, Cham (2002). https:\/\/doi.org\/10.1007\/978-1-4757-3661-8","DOI":"10.1007\/978-1-4757-3661-8"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Sch\u00f6pf, J., Middeldorp, A.: Confluence criteria for logically constrained rewrite systems. In: Pientka, B., Tinelli, C. (eds.) Automated Deduction \u2013 CADE 29. CADE 2023. LNCS, vol. 14132, pp. 474\u2013490. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38499-8_27","DOI":"10.1007\/978-3-031-38499-8_27"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Sch\u00f6pf, J., Mitterwallner, F., Middeldorp, A.: Confluence of logically constrained rewrite systems revisited. In: Benzm\u00fcller, C., Heule, M.J., Schmidt, R.A. (eds.) Automated Reasoning. IJCAR 2024. LNCS, vol. 14740, pp. 298\u2013316. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63501-4_16","DOI":"10.1007\/978-3-031-63501-4_16"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Takahata, K., Sch\u00f6pf, J., Nishida, N., Aoto, T.: Characterizing equivalence of logically constrained terms via existentially constrained terms. CoRR abs\/2505.21986, 1\u201329 (2025). https:\/\/doi.org\/10.48550\/arXiv.2505.21986","DOI":"10.48550\/arXiv.2505.21986"},{"key":"12_CR14","unstructured":"Takahata, K., Sch\u00f6pf, J., Nishida, N., Aoto, T.: Recovering commutation of logically constrained rewriting and equivalence transformations. In: Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming. ACM (2025). to appear"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Winkler, S., Middeldorp, A.: Completion for logically constrained rewriting. In: Kirchner, H. (ed.) Proceedings of the 3rd FSCD. LIPIcs, vol.\u00a0108, pp. 30:1\u201330:18 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2018.30","DOI":"10.4230\/LIPIcs.FSCD.2018.30"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-030-68446-4_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S Winkler","year":"2021","unstructured":"Winkler, S., Moser, G.: Runtime complexity analysis of logically constrained rewriting. In: LOPSTR 2020. LNCS, vol. 12561, pp. 37\u201355. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68446-4_2"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04848-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:59:52Z","timestamp":1757678392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04848-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"ISBN":["9783032048479","9783032048486"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04848-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"9 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}