{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:12:52Z","timestamp":1762459972426,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030789459"},{"type":"electronic","value":"9783030789466"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78946-6_6","type":"book-chapter","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T06:02:53Z","timestamp":1623909773000},"page":"102-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Powerful and NP-Complete: Hypergraph Lambek Grammars"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4779-3143","authenticated-orcid":false,"given":"Tikhon","family":"Pshenitsyn","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,18]]},"reference":[{"key":"6_CR1","unstructured":"Bar-Hillel, Y., Gaifman, C., Shamir, E.: On categorial and phrase-structure grammars. Bulletin of the Research Council of Israel F(9), 1\u201316 (1963)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Drewes, F., Kreowski, H.-J., Habel, A.: Hyperedge replacement graph grammars (1997)","DOI":"10.1142\/9789812384720_0002"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10849-009-9109-6","volume":"19","author":"M Kanazawa","year":"2010","unstructured":"Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. J. Log. Lang. Inf. 19, 137\u2013161 (2010)","journal-title":"J. Log. Lang. Inf."},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1080\/00029890.1958.11989160","volume":"65","author":"J Lambek","year":"1958","unstructured":"Lambek, J.: The mathematics of sentence structure. Am. Math. Monthly 65(3), 154\u2013170 (1958)","journal-title":"Am. Math. Monthly"},{"issue":"3\/4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00159344","volume":"5","author":"M Moortgat","year":"1996","unstructured":"Moortgat, M.: Multimodal linguistic inference. J. Log. Lang. Inf. 5(3\/4), 349\u2013385 (1996)","journal-title":"J. Log. Lang. Inf."},{"issue":"1\u20133","key":"6_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.tcs.2006.03.018","volume":"357","author":"M Pentus","year":"2006","unstructured":"Pentus, M.: Lambek calculus is NP-complete. Theor. Comput. Sci. 357(1\u20133), 186\u2013201 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR7","unstructured":"Pentus, M.: Lambek grammars are context free. In: Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS 1993), Montreal, Canada. IEEE Computer Society (1993)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51372-6","volume-title":"Graph Transformation","year":"2020","unstructured":"Gadducci, F., Kehrer, T. (eds.): ICGT 2020. LNCS, vol. 12150. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6"},{"key":"6_CR9","unstructured":"Pshenitsyn, T.: Introduction to a Hypergraph Logic Unifying Different Variants of the Lambek Calculus. Preprint at arXiv.org. https:\/\/arxiv.org\/abs\/2103.01199"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Pshenitsyn, T.: Weak Greibach Normal Form for Hyperedge Replacement Grammars. In: Electronic Proceedings in Theoretical Computer Science, vol. 330, pp. 108\u2013125. Open Publishing Association (2020)","DOI":"10.4204\/EPTCS.330.7"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78946-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,21]],"date-time":"2021-06-21T23:31:40Z","timestamp":1624318300000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78946-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030789459","9783030789466"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78946-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2021","order":10,"name":"conference_id","label":"Conference ID","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":"26","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":"14","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":"54% - 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":"3","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":"3","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)"}},{"value":"In addition, the proceedings contain 2 tool papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}