{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:56Z","timestamp":1725489356254},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734475"},{"type":"electronic","value":"9783540734499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73449-9_22","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T16:49:53Z","timestamp":1187023793000},"page":"288-302","source":"Crossref","is-referenced-by-count":4,"title":["Sequence Unification Through Currying"],"prefix":"10.1007","author":[{"given":"Temur","family":"Kutsia","sequence":"first","affiliation":[]},{"given":"Jordi","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0103291","volume-title":"A Tight, Practical Integration of Relations and Functions","author":"H. Boley","year":"1999","unstructured":"Boley, H.: A Tight, Practical Integration of Relations and Functions. LNCS, vol.\u00a01712. Springer, Heidelberg (1999)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jal.2005.10.006","volume":"4","author":"B. Buchberger","year":"2006","unstructured":"Buchberger, B., Cr\u01ceciun, A., Jebelean, T., Kov\u00e1cs, L., Kutsia, T., Nakagawa, K., Piroi, F., Popov, N., Robu, J., Rosenkranz, M., Windsteiger, W.: Theorema: Towards computer-aided mathematical theory exploration. J.\u00a0Applied Logic\u00a04, 470\u2013504 (2006)","journal-title":"J.\u00a0Applied Logic"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/3-540-49674-2_4","volume-title":"Logic Program Synthesis and Transformation","author":"E. Chasseur","year":"1998","unstructured":"Chasseur, E., Deville, Y.: Logic program schemas, constraints and semi-unification. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 69\u201389. Springer, Heidelberg (1998)"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1007\/978-3-540-30469-2_17","volume-title":"On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE","author":"J. Coelho","year":"2004","unstructured":"Coelho, J., Florido, M.: CLP(Flex): Constraint logic programming applied to XML processing. In: Meersman, R., Tari, Z. (eds.) On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE. LNCS, vol.\u00a03291, pp. 1098\u20131112. Springer, Heidelberg (2004)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/11610496_20","volume-title":"Advanced Web and Network Technologies, and Applications","author":"J. Coelho","year":"2006","unstructured":"Coelho, J., Florido, M.: VeriFLog: A constraint logic programming approach to verification of website content. In: Shen, H.T., Li, J., Li, M., Ni, J., Wang, W. (eds.) Advanced Web and Network Technologies, and Applications. LNCS, vol.\u00a03842, pp. 148\u2013156. Springer, Heidelberg (2006)"},{"key":"22_CR6","unstructured":"Common Logic Working Group. Common Logic Standard (2007), http:\/\/philebus.tamu.edu\/cl\/"},{"key":"22_CR7","first-page":"342","volume-title":"Algebraic aspects of combinatorics on words, ch. 12","author":"V. Diekert","year":"2002","unstructured":"Diekert, V.: Makanin\u2019s algorithm. In: Algebraic aspects of combinatorics on words, ch. 12, pp. 342\u2013390. Cambridge University Press, Cambridge (2002)"},{"key":"22_CR8","unstructured":"Genesereth, M.R., Petrie, C., Hinrichs, T., Hondroulis, A., Kassoff, M., Love, N., Mohsin, W.: Knowledge Interchange Format, draft proposed American National Standard (dpANS) Technical Report NCITS.T2\/98-004 (1998)"},{"issue":"3","key":"22_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/122296.122304","volume":"2","author":"M.L. Ginsberg","year":"1991","unstructured":"Ginsberg, M.L.: The MVL theorem proving system. SIGART Bull.\u00a02(3), 57\u201360 (1991)","journal-title":"SIGART Bull"},{"key":"22_CR10","unstructured":"Hamana, M.: Term rewriting with sequences. In: Proc. of the First Int. Theorema Workshop. Technical report 97\u201320, RISC, Linz, Austria (1997)"},{"key":"22_CR11","unstructured":"Hayes, P., Menzel, C.: Semantics of Knowledge Interchange Format (2001), http:\/\/reliant.teknowledge.com\/IJCAI01\/HayesMenzel-SKIF-IJCAI2001.pdf"},{"key":"22_CR12","unstructured":"Hayes, P.J., Menzel, C.: Simple common logic. In: W3C Workshop on Rule Languages for Interoperability. W3C (2005)"},{"issue":"1","key":"22_CR13","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\u00a037(1), 47\u201385 (1990)","journal-title":"J. ACM"},{"key":"22_CR14","unstructured":"Koller, A.: Evaluating context unification for semantic underspecification. In: 3rd ESSLLI Student Session (ESSLLI 1998), August 17-28, pp. 188\u2013199 (1998)"},{"key":"22_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-45470-5_26","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"T. Kutsia","year":"2002","unstructured":"Kutsia, T.: Unification with sequence variables and flexible arity symbols and its extension with pattern-terms. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol.\u00a02385, pp. 290\u2013304. Springer, Heidelberg (2002)"},{"issue":"3","key":"22_CR16","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. Journal of Symbolic Computation\u00a042(3), 352\u2013388 (2007)","journal-title":"Journal of Symbolic Computation"},{"key":"22_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11591191_16","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"T. Kutsia","year":"2005","unstructured":"Kutsia, T., Marin, M.: Matching with regular constraints. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol.\u00a03835, pp. 215\u2013229. Springer, Heidelberg (2005)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61464-8_63","volume-title":"Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA 1996)","author":"J. Levy","year":"1996","unstructured":"Levy, J.: Linear second-order unification. In: Ganzinger, H. (ed.) Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA 1996). LNCS, vol.\u00a01103, pp. 332\u2013346. Springer, Heidelberg (1996)"},{"key":"22_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/11532231_11","volume-title":"Proc. of the 20th Int. Conf. on Automated Deduction, CADE-20","author":"J. Levy","year":"2005","unstructured":"Levy, J., Niehren, J., Villaret, M.: Well-nested context unification. In: Nieuwenhuis, R. (ed.) Proc. of the 20th Int. Conf. on Automated Deduction, CADE-20. LNCS (LNAI), vol.\u00a03632, pp. 149\u2013163. Springer, Heidelberg (2005)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45127-7_14","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"2001","unstructured":"Levy, J., Villaret, M.: Context unification and traversal equations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 169\u2013184. Springer, Heidelberg (2001)"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/3-540-45610-4_23","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"2002","unstructured":"Levy, J., Villaret, M.: Currying second-order unification problems. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 326\u2013339. Springer, Heidelberg (2002)"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. Math. USSR Sbornik\u00a032(2), 129\u2013198 (1977)","journal-title":"Math. USSR Sbornik"},{"issue":"1\u20132","key":"22_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.3166\/jancl.16.151-168","volume":"16","author":"M. Marin","year":"2006","unstructured":"Marin, M., Kutsia, T.: Foundations of the rule-based system RhoLog. Journal of Applied Non.-Classical Logics\u00a016(1\u20132), 151\u2013168 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: Proc. of the 35th Annual Meeting of the ACL and the 8th Conf. of the European Chapter of the ACL (ACL 1997), pp. 410\u2013417 (1997)","DOI":"10.3115\/976909.979670"},{"key":"22_CR25","first-page":"361","volume-title":"Logic and Computer Science","author":"L. Paulson","year":"1990","unstructured":"Paulson, L.: Isabelle: the next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science, pp. 361\u2013386. Academic Press, San Diego (1990)"},{"key":"22_CR26","first-page":"495","volume-title":"Proc. of the 40th Annual Symp. on Foundations of Computer Science, FOCS 1999","author":"W. Plandowski","year":"1999","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: Proc. of the 40th Annual Symp. on Foundations of Computer Science, FOCS 1999, New York City, USA, pp. 495\u2013500. IEEE Press, Orlando, Florida, USA (1999)"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-49674-2_14","volume-title":"Logic Program Synthesis and Transformation","author":"J. Richardson","year":"1998","unstructured":"Richardson, J., Fuchs, N.E.: Development of correct transformation schemata for Prolog programs. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 263\u2013281. Springer, Heidelberg (1997)"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1093\/logcom\/12.6.929","volume":"12","author":"M. Schmidt-Schau\u00df","year":"2002","unstructured":"Schmidt-Schau\u00df, M.: A decision algorithm for stratified context unification. Journal of Logic and Computation\u00a012, 929\u2013953 (2002)","journal-title":"Journal of Logic and Computation"},{"issue":"6","key":"22_CR29","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s00224-004-1151-9","volume":"37","author":"M. Schmidt-Schau\u00df","year":"2004","unstructured":"Schmidt-Schau\u00df, M., Stuber, J.: The complexity of linear and stratified context matching problems. Theory of Computing Syst.\u00a037(6), 717\u2013740 (2004)","journal-title":"Theory of Computing Syst."},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-55124-7_4","volume-title":"Word Equations and Related Topics","author":"K.U. Schulz","year":"1992","unstructured":"Schulz, K.U.: Makanin\u2019s algorithm for word equations \u2013 two improvements and a generalization. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol.\u00a0572, pp. 85\u2013150. Springer, Heidelberg (1992)"},{"key":"22_CR31","unstructured":"Wolfram, S.: The Mathematica Book. Wolfram Media, 5th edn. (2003)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73449-9_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:12:34Z","timestamp":1619518354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73449-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734475","9783540734499"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73449-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}