{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:41:02Z","timestamp":1743064862607,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031712937"},{"type":"electronic","value":"9783031712944"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-71294-4_3","type":"book-chapter","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:03:47Z","timestamp":1725631427000},"page":"47-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deciding Knowledge Problems Modulo Classes of\u00a0Permutative Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7574-195X","authenticated-orcid":false,"given":"Serdar","family":"Erbatur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0522-8384","authenticated-orcid":false,"given":"Andrew M.","family":"Marshall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4521-5892","authenticated-orcid":false,"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5937-6059","authenticated-orcid":false,"given":"Christophe","family":"Ringeissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,7]]},"reference":[{"issue":"1\u20132","key":"3_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci. 367(1\u20132), 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Hankin, C., Schmidt, D. (eds.) Conference Record of POPL 2001: The 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, London, UK, 17\u201319 January 2001, pp. 104\u2013115. ACM (2001)","DOI":"10.1145\/360204.360213"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Ak\u00e7am, Z., Cornell, K.A., Hono\u00a0II, D.S., Narendran, P., Pulver, A.: On problems dual to unification: the string-rewriting case (2023). https:\/\/doi.org\/10.48550\/arXiv.2103.00386","DOI":"10.48550\/arXiv.2103.00386"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-73449-9_4","volume-title":"Term Rewriting and Applications","author":"S Anantharaman","year":"2007","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Intruders with caps. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 20\u201335. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73449-9_4"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.tcs.2017.01.027","volume":"672","author":"M Ayala-Rinc\u00f3n","year":"2017","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Intruder deduction problem for locally stable theories with normal forms and inverses. Theor. Comput. Sci. 672, 64\u2013100 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR6","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, New York, NY, USA (1998)"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445\u2013532. Elsevier and MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2422085.2422089","volume":"14","author":"M Baudet","year":"2013","unstructured":"Baudet, M., Cortier, V., Delaune, S.: YAPA: a generic tool for computing intruder knowledge. ACM Trans. Comput. Log. 14(1), 4 (2013)","journal-title":"ACM Trans. Comput. Log."},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-540-71070-7_30","volume-title":"Automated Reasoning","author":"T Boy de la Tour","year":"2008","unstructured":"Boy de la Tour, T., Echenim, M., Narendran, P.: Unification and matching modulo leaf-permutative equational presentations. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 332\u2013347. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-71070-7_30"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Bunch, C., Satterfield, S.D., Erbatur, S., Marshall, A.M., Ringeissen, C.: Knowledge problems in protocol analysis: extending the notion of subterm convergent (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.17226","DOI":"10.48550\/arXiv.2401.17226"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Chadha, R., Cheval, V., Ciob\u00e2c\u0103, S., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. ACM Trans. Comput. Log. 17(4), 23:1\u201323:32 (2016)","DOI":"10.1145\/2926715"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10817-010-9197-7","volume":"48","author":"S Ciob\u00e2c\u0103","year":"2012","unstructured":"Ciob\u00e2c\u0103, S., Delaune, S., Kremer, S.: Computing knowledge in security protocols under convergent equational theories. J. Autom. Reasoning 48(2), 219\u2013262 (2012)","journal-title":"J. Autom. Reasoning"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Cohn-Gordon, K., Cremers, C., Garratt, L., Millican, J., Milner, K.: On ends-to-ends encryption: asynchronous group messaging with strong security guarantees. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 1802\u20131819. ACM (2018)","DOI":"10.1145\/3243734.3243747"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1994.1043","volume":"111","author":"H Comon","year":"1994","unstructured":"Comon, H., Haberstrau, M., Jouannaud, J.: Syntacticness, cycle-syntacticness, and shallow theories. Inf. Comput. 111(1), 154\u2013191 (1994)","journal-title":"Inf. Comput."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-54455-6_6","volume-title":"Principles of Security and Trust","author":"J Dreier","year":"2017","unstructured":"Dreier, J., Dum\u00e9nil, C., Kremer, S., Sasse, R.: Beyond subterm-convergent equational theories in automated verification of stateful protocols. In: Maffei, M., Ryan, M. (eds.) POST 2017. LNCS, vol. 10204, pp. 117\u2013140. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54455-6_6"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-63046-5_5","volume-title":"Automated Deduction \u2013 CADE 26","author":"S Erbatur","year":"2017","unstructured":"Erbatur, S., Marshall, A.M., Ringeissen, C.: Notions of knowledge in combinations of theories sharing constructors. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 60\u201376. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_5"},{"issue":"6","key":"3_CR17","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1017\/S0960129520000031","volume":"30","author":"S Erbatur","year":"2020","unstructured":"Erbatur, S., Marshall, A.M., Ringeissen, C.: Computing knowledge in equational extensions of subterm convergent theories. Math. Struct. Comput. Sci. 30(6), 683\u2013709 (2020)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321495.321508","volume":"16","author":"JE Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Some results on tape-bounded Turing machines. J. ACM 16(1), 168\u2013177 (1969)","journal-title":"J. ACM"},{"key":"3_CR19","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"SY Kuroda","year":"1964","unstructured":"Kuroda, S.Y.: Classes of languages and linear-bounded automata. Inf. Control 7(2), 207\u2013223 (1964)","journal-title":"Inf. Control"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45620-1_37","volume-title":"Automated Deduction\u2014CADE-18","author":"C Lynch","year":"2002","unstructured":"Lynch, C., Morawska, B.: Basic syntactic mutation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 471\u2013485. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45620-1_37"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1005764526878","volume":"19","author":"P Narendran","year":"1997","unstructured":"Narendran, P., Otto, F.: Single versus simultaneous equational unification and equational unification for variable-permuting theories. J. Autom. Reason. 19(1), 87\u2013115 (1997)","journal-title":"J. Autom. Reason."},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2730","volume":"147","author":"R Nieuwenhuis","year":"1998","unstructured":"Nieuwenhuis, R.: Decidability and complexity analysis by basic paramodulation. Inf. Comput. 147(1), 1\u201321 (1998)","journal-title":"Inf. Comput."},{"key":"3_CR24","unstructured":"Satterfield, S.D., Erbatur, S., Marshall, A.M., Ringeissen, C.: Knowledge problems in security protocols: going beyond subterm convergent theories. In: Gaboardi, M., van Raamsdonk, F. (eds.) 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023, 3\u20136 July 2023, Rome, Italy. LIPIcs, vol.\u00a0260, pp. 30:1\u201330:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"issue":"4","key":"3_CR25","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0747-7171(89)80037-9","volume":"8","author":"M Schmidt-Schau\u00df","year":"1989","unstructured":"Schmidt-Schau\u00df, M.: Unification in permutative equational theories is undecidable. J. Symb. Comput. 8(4), 415\u2013421 (1989)","journal-title":"J. Symb. Comput."}],"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-031-71294-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:04:08Z","timestamp":1725631448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71294-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031712937","9783031712944"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71294-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 September 2024","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":"Milan","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.fm24.polimi.it\/?page_id=63#lopstrppdp2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}