{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,10]],"date-time":"2026-10-10T02:11:09Z","timestamp":1791598269151,"version":"4.3.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319900490","type":"print"},{"value":"9783319900506","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-90050-6_2","type":"book-chapter","created":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T12:33:32Z","timestamp":1523968412000},"page":"17-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Concatenation, Separation, and Other Properties of Variably Polyadic Relations"],"prefix":"10.1007","author":[{"given":"Heba","family":"Aamer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haythem O.","family":"Ismail","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","volume":"40","author":"A Blumer","year":"1985","unstructured":"Blumer, A., Blumer, J., Haussler, D., Ehrenfeucht, A., Chen, M.T., Seiferas, J.: The smallest automaton recognizing the subwords of a text. Theoret. Comput. Sci. 40, 31\u201355 (1985)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1016\/j.ejc.2009.07.005","volume":"31","author":"I Cristea","year":"2010","unstructured":"Cristea, I., \u015etef\u0103nescu, M.: Hypergroups and n-ary relations. Eur. J. Comb. 31(3), 780\u2013789 (2010)","journal-title":"Eur. J. Comb."},{"key":"2_CR3","volume-title":"Text Algorithms","author":"M Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press Inc., New York (1994)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/jj.13027259.6","volume-title":"The Logic of Decision and Action","author":"D Davidson","year":"1967","unstructured":"Davidson, D.: The logical form of action sentences. In: Recher, N. (ed.) The Logic of Decision and Action, pp. 81\u201395. University of Pittsburgh Press, Pittsburgh (1967)"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Can. J. Math. 18(1), 106\u2013112 (1966)","journal-title":"Can. J. Math."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1215\/00318108-109-1-1","volume":"109","author":"K Fine","year":"2000","unstructured":"Fine, K.: Neutral relations. Philos. Rev. 109(1), 1\u201333 (2000)","journal-title":"Philos. Rev."},{"key":"2_CR7","unstructured":"Graham, S.: String Searching Algorithms, vol. 3. World Scientific, Singapore (1994)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)","DOI":"10.1017\/CBO9780511574931"},{"key":"2_CR9","volume-title":"The Logica Yearbook 2016","author":"HO Ismail","year":"2017","unstructured":"Ismail, H.O.: Four remarks on relations and predication. In: Arazim, P., Lavicka, T. (eds.) The Logica Yearbook 2016. College Publications, London (2017)"},{"key":"2_CR10","volume-title":"Action Emotion and Will","author":"A Kenny","year":"1963","unstructured":"Kenny, A.: Action Emotion and Will. Routledge and Kegan Paul, London (1963)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S1755020308080222","volume":"1","author":"J Leo","year":"2008","unstructured":"Leo, J.: The identity of argument places. Rev. Symbolic Logic 1, 335\u2013354 (2008)","journal-title":"Rev. Symbolic Logic"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/s10992-007-9076-9","volume":"37","author":"J Leo","year":"2008","unstructured":"Leo, J.: Modeling relations. J. Philos. Logic 37, 353\u2013385 (2008)","journal-title":"J. Philos. Logic"},{"key":"2_CR13","unstructured":"MacBride, F.: Relations. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University, Winter 2016 edn. (2016)"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2214634","volume":"9","author":"A Morton","year":"1975","unstructured":"Morton, A.: Complex individuals and multigrade relations. No\u00fbs 9(3), 309\u2013318 (1975)","journal-title":"No\u00fbs"},{"issue":"452","key":"2_CR15","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1093\/mind\/113.452.609","volume":"113","author":"A Oliver","year":"2004","unstructured":"Oliver, A., Smiley, T.: Multigrade predicates. Mind 113(452), 609\u2013681 (2004)","journal-title":"Mind"},{"key":"2_CR16","volume-title":"Events in the Semantics of English","author":"T Parsons","year":"1990","unstructured":"Parsons, T.: Events in the Semantics of English. MIT Press, Cambridge (1990)"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-40511-2_10","volume-title":"Availability, Reliability, and Security in Information Systems and HCI","author":"I Savnik","year":"2013","unstructured":"Savnik, I.: Index data structure for fast subset and superset queries. In: Cuzzocrea, A., Kittl, C., Simos, D.E., Weippl, E., Xu, L. (eds.) CD-ARES 2013. LNCS, vol. 8127, pp. 134\u2013148. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40511-2_10"},{"key":"2_CR18","unstructured":"Sedgewick, R., Wayne, K.: Algorithms. Addison-Wesley Professional, Boston (2011)"},{"key":"2_CR19","first-page":"175","volume-title":"Natural Language Processing and Knowledge Representation: Language for Knowledge and Knowledge for Language","author":"SC Shapiro","year":"2000","unstructured":"Shapiro, S.C.: SNePS: a logic for natural language understanding and commonsense reasoning. In: Iwa\u0144ska, \u0141.M., Shapiro, S.C. (eds.) Natural Language Processing and Knowledge Representation: Language for Knowledge and Knowledge for Language, pp. 175\u2013195. AAAI Press\/The MIT Press, Menlo Park (2000)"},{"issue":"10","key":"2_CR20","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/PROC.1986.13637","volume":"74","author":"SC Shapiro","year":"1986","unstructured":"Shapiro, S.C.: Symmetric relations, intensional individuals, and variable binding. Proc. IEEE 74(10), 1354\u20131363 (1986)","journal-title":"Proc. IEEE"},{"key":"2_CR21","first-page":"375","volume":"139\u2013140","author":"B Taylor","year":"1992","unstructured":"Taylor, B., Hazen, A.P.: Flexibly structured predication. Logique Anal. 139\u2013140, 375\u2013393 (1992)","journal-title":"Logique Anal."}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90050-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T02:50:21Z","timestamp":1720234221000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90050-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319900490","9783319900506"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90050-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}