{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:15:47Z","timestamp":1743146147006,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030984786"},{"type":"electronic","value":"9783030984793"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-98479-3_14","type":"book-chapter","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T13:16:56Z","timestamp":1648646216000},"page":"279-296","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Unranked Nominal Unification"],"prefix":"10.1007","author":[{"given":"Besik","family":"Dundua","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Temur","family":"Kutsia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikheil","family":"Rukhaia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-319-94460-9_14","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Ayala-Rinc\u00f3n","year":"2018","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Nominal C-unification. In: Fioravanti, F., Gallagher, J.P. (eds.) LOPSTR 2017. LNCS, vol. 10855, pp. 235\u2013251. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94460-9_14"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2019.02.020","volume":"781","author":"M Ayala-Rinc\u00f3n","year":"2019","unstructured":"Ayala-Rinc\u00f3n, M., de Carvalho-Segundo, W., Fern\u00e1ndez, M., Nantes-Sobrinho, D., Rocha-Oliveira, A.C.: A formalisation of nominal $$\\alpha $$-equivalence with A, C, and AC function symbols. Theoret. Comput. Sci. 781, 3\u201323 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR3","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: Fixed-point constraints for nominal equational unification. In: Kirchner, H. (ed.), 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, 9\u201312 July 2018, Oxford, UK, vol. 108, LIPIcs, pp. 7:1\u20137:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"1","key":"14_CR4","first-page":"1","volume":"16","author":"M Ayala-Rinc\u00f3n","year":"2020","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Nantes-Sobrinho, D.: On nominal syntax and permutation fixed points. Log. Methods Comput. Sci. 16(1), 1\u201336 (2020)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"14_CR5","first-page":"57","volume":"323","author":"M Ayala-Rinc\u00f3n","year":"2016","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Rocha-Oliveira, A.C.: Completeness in PVS of a nominal unification algorithm. ENTCS 323(3), 57\u201374 (2016)","journal-title":"ENTCS"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-45260-5_8","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Ayala-Rinc\u00f3n","year":"2020","unstructured":"Ayala-Rinc\u00f3n, M., Fern\u00e1ndez, M., Silva, G.F., Nantes-Sobrinho, D.: A certified functional nominal C-Unification algorithm. In: Gabbrielli, M. (ed.) LOPSTR 2019. LNCS, vol. 12042, pp. 123\u2013138. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45260-5_8"},{"key":"14_CR7","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":"14_CR8","doi-asserted-by":"crossref","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Robinson, J.A., Voronkov, A. (eds) [35], pp. 445\u2013532","DOI":"10.1016\/B978-044450813-3\/50010-2"},{"key":"14_CR9","unstructured":"de Carvalho Segundo, W.: Nominal Equational Problems Modulo Associativity, Commutativity and Associativity-Commutativity. Ph.D. thesis, Universidade de Bras\u00edlia, Brazil (2019)"},{"key":"14_CR10","first-page":"387","volume":"90","author":"V Diekert","year":"2002","unstructured":"Diekert, V.: Makanin\u2019s algorithm. Algebraic Comb. Words 90, 387\u2013442 (2002)","journal-title":"Algebraic Comb. Words"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Dowek, G.: Higher-order unification and matching. In: Robinson, J.A., Voronkov, A., (eds.) [35], pp. 1009\u20131062","DOI":"10.1016\/B978-044450813-3\/50018-7"},{"issue":"3\u20135","key":"14_CR12","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M Gabbay","year":"2002","unstructured":"Gabbay, M., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal ASP Comput. 13(3\u20135), 341\u2013363 (2002)","journal-title":"Formal ASP Comput."},{"key":"14_CR13","unstructured":"Genesereth, M.R., Fikes, R.E.: Knowledge Interchange Format. Version 3.0. Reference Manual. Technical report KSL-92-86, Computer Science Department, Stanford University, June 1992"},{"key":"14_CR14","unstructured":"Horozal, F.: A Framework for Defining Declarative Languages. Ph.D. thesis, Jacobs University Bremen (2014)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-08434-3_23","volume-title":"Intelligent Computer Mathematics","author":"F Horozal","year":"2014","unstructured":"Horozal, F., Rabe, F., Kohlhase, M.: Flexary operators for formalized mathematics. In: Watt, S.M., Davenport, J.H., Sexton, A.P., Sojka, P., Urban, J. (eds.) CICM 2014. LNCS (LNAI), vol. 8543, pp. 312\u2013327. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08434-3_23"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11663881_12","volume-title":"Foundations of Information and Knowledge Systems","author":"I Horrocks","year":"2006","unstructured":"Horrocks, I., Voronkov, A.: Reasoning support for expressive ontology languages using a theorem prover. In: Dix, J., Hegner, S.J. (eds.) FoIKS 2006. LNCS, vol. 3861, pp. 201\u2013218. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11663881_12"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J Jaffar","year":"1990","unstructured":"Jaffar, J.: Minimal and complete word unification. J. ACM 37(1), 47\u201385 (1990)","journal-title":"J. ACM"},{"key":"14_CR18","first-page":"257","volume-title":"Computational Logic - Essays in Honor of Alan Robinson","author":"J Jouannaud","year":"1991","unstructured":"Jouannaud, J., Kirchner, C.: Solving equations in abstract algebras: a rule-based survey of unification. In: Lassez, J., Plotkin, G.D. (eds.) Computational Logic - Essays in Honor of Alan Robinson, pp. 257\u2013321. The MIT Press, Cambridge (1991)"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/62029.62030","volume":"21","author":"K Knight","year":"1989","unstructured":"Knight, K.: Unification: a multidisciplinary survey. ACM Comput. Surv. 21(1), 93\u2013124 (1989)","journal-title":"ACM Comput. Surv."},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-44881-0_26","volume-title":"Rewriting Techniques and Applications","author":"T Kutsia","year":"2003","unstructured":"Kutsia, T.: Equational prover of Theorema. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 367\u2013379. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44881-0_26"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-30210-0_14","volume-title":"Artificial Intelligence and Symbolic Computation","author":"T Kutsia","year":"2004","unstructured":"Kutsia, T.: Solving equations involving sequence variables and sequence functions. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 157\u2013170. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30210-0_14"},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/j.jsc.2006.12.002","volume":"42","author":"T Kutsia","year":"2007","unstructured":"Kutsia, T.: Solving equations with sequence variables and sequence functions. J. Symb. Comput. 42(3), 352\u2013388 (2007)","journal-title":"J. Symb. Comput."},{"key":"14_CR23","unstructured":"Kutsia, T.: Unification modulo alpha-equivalence in a mathematical assistant system. RISC Report Series 20\u201301, RISC, Johannes Kepler University Linz (2020)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-27818-4_15","volume-title":"Mathematical Knowledge Management","author":"T Kutsia","year":"2004","unstructured":"Kutsia, T., Buchberger, B.: Predicate logic with sequence variables and sequence function symbols. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 205\u2013219. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27818-4_15"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-540-73449-9_22","volume-title":"Term Rewriting and Applications","author":"T Kutsia","year":"2007","unstructured":"Kutsia, T., Levy, J., Villaret, M.: Sequence unification through currying. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 288\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73449-9_22"},{"issue":"1","key":"14_CR26","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jsc.2009.07.001","volume":"45","author":"T Kutsia","year":"2010","unstructured":"Kutsia, T., Levy, J., Villaret, M.: On the relation between context and sequence unification. J. Symb. Comput. 45(1), 74\u201395 (2010)","journal-title":"J. Symb. Comput."},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Kutsia, T., Marin, M.: Solving, reasoning, and programming in common logic. In: Voronkov, A., (eds), 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, Timisoara, Romania, 26\u201329 September 2012, pp. 119\u2013126. IEEE Computer Society (2012)","DOI":"10.1109\/SYNASC.2012.27"},{"issue":"2","key":"14_CR28","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2159531.2159532","volume":"13","author":"J Levy","year":"2012","unstructured":"Levy, J., Villaret, M.: Nominal unification from a higher-order perspective. ACM Trans. Comput. Log. 13(2), 10:1-10:31 (2012)","journal-title":"ACM Trans. Comput. Log."},{"issue":"2","key":"14_CR29","first-page":"147","volume":"145","author":"GS Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Matematicheskii Sbornik 145(2), 147\u2013236 (1977)","journal-title":"Matematicheskii Sbornik"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s11229-009-9661-2","volume":"182","author":"C Menzel","year":"2011","unstructured":"Menzel, C.: Knowledge representation, the world wide web, and the evolution of logic. Synth. 182(2), 269\u2013295 (2011)","journal-title":"Synth."},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Paterson, M., Wegman, M.N.: Linear unification. In: Chandra, A.K., Wotschke, D., Friedman, Harrison, M.A., (eds.), Proceedings of the 8th Annual ACM Symposium on Theory of Computing, pp. 181\u2013186. ACM (1976)","DOI":"10.1145\/800113.803646"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction \u2014 CADE-16","author":"Frank Pfenning","year":"1999","unstructured":"Pfenning, Frank, Sch\u00fcrmann, Carsten: System description: Twelf \u2014 a meta-logical framework for deductive systems. In: CADE 1999. LNCS (LNAI), vol. 1632, pp. 202\u2013206. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48660-7_14"},{"issue":"2","key":"14_CR33","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0890-5401(03)00138-X","volume":"186","author":"AM Pitts","year":"2003","unstructured":"Pitts, A.M.: Nominal logic, a first order theory of names and binding. Inf. Comput. 186(2), 165\u2013193 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"14_CR34","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"14_CR35","unstructured":"Robinson, J.A., Voronkov, A., (eds.) Handbook of Automated Reasoning (in 2 volumes). Elsevier and MIT Press (2001)"},{"key":"14_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-319-63139-4_19","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M Schmidt-Schau\u00df","year":"2017","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M.: Nominal unification of higher order expressions with recursive let. In: Hermenegildo, M.V., Lopez-Garcia, P. (eds.) LOPSTR 2016. LNCS, vol. 10184, pp. 328\u2013344. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63139-4_19"},{"key":"14_CR37","unstructured":"Schmidt-Schau\u00df, M., Kutsia, T., Levy, J., Villaret, M., Kutz, Y.: Nominal unification of higher order expressions with recursive let. Frank report 62, Institut f\u00fcr Informatik, Goethe-Universit\u00e4t Frankfurt am Main, October 2019"},{"key":"14_CR38","unstructured":"Schmidt-Schau\u00df, M., Sabel, D.: Nominal unification with atom and context variables. In: Kirchner, H., (ed.), 3rd International Conference on Formal Structures for Computation and Deduction, FSCD 2018, 9\u201312 July 2018, Oxford, UK, vol. 108, LIPIcs, pp. 28:1\u201328:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"issue":"1\u20133","key":"14_CR39","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/j.tcs.2004.06.016","volume":"323","author":"C Urban","year":"2004","unstructured":"Urban, C., Pitts, A.M., Gabbay, M.: Nominal unification. Theor. Comput. Sci. 323(1\u20133), 473\u2013497 (2004)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Language, Logic, and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-98479-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T22:07:22Z","timestamp":1649455642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-98479-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030984786","9783030984793"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-98479-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TbiLLC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Tbilisi Symposium on Logic, Language, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Batumi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Georgia","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tbillc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/archive.illc.uva.nl\/Tbilisi\/Tbilisi2019\/index.html","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":"17","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":"17","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":"100% - 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":"2","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":"1","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)"}}]}}