{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:40Z","timestamp":1786978900090,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031777912","type":"print"},{"value":"9783031777929","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,20]],"date-time":"2024-11-20T00:00:00Z","timestamp":1732060800000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-77792-9_27","type":"book-chapter","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T06:50:22Z","timestamp":1732258222000},"page":"453-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Modelling and\u00a0Mining Knowledge About Computational Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1499-2090","authenticated-orcid":false,"given":"Anton","family":"Gnatenko","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1517-7354","authenticated-orcid":false,"given":"Oliver","family":"Kutz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5763-6080","authenticated-orcid":false,"given":"Nicolas","family":"Troquard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,11,20]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"27_CR2","unstructured":"Bodily, P.M., Ventura, D.: Open computational creativity problems in computational theory. In: Hedblom, M.M., Kantosalo, A.A., Confalonieri, R., Kutz, O., Veale, T. (eds.) Proceedings of the 13th International Conference on Computational Creativity, Bozen-Bolzano, Italy, 27 June\u20131 July 2022, pp. 112\u2013120. Association for Computational Creativity (ACC) (2022). http:\/\/computationalcreativity.net\/iccc22\/papers\/ICCC-2022_paper_61.pdf"},{"key":"27_CR3","unstructured":"Brown, T.B., et al.: Language models are few-shot learners. In: Proceedings of the 34th International Conference on Neural Information Processing Systems. NIPS \u201920. Curran Associates Inc., Red Hook, NY, USA (2020)"},{"key":"27_CR4","unstructured":"Carlisle, D., et al.: Mathematical Markup Language (MathML) Version 2.0. World Wide Web (2000)"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.2307\/2269326","volume":"1","author":"A Church","year":"1936","unstructured":"Church, A.: A Note on the Entscheidungsproblem. J. Symb. Log. 1(1), 40\u201341 (1936). https:\/\/doi.org\/10.2307\/2269326","journal-title":"J. Symb. Log."},{"key":"27_CR6","doi-asserted-by":"publisher","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC \u201971, pp. 151\u2013158. Association for Computing Machinery, New York, NY, USA (1971). https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1134\/S1064562422700016","volume":"106","author":"AM Elizarov","year":"2022","unstructured":"Elizarov, A.M., Kirillovich, A.V., Lipachev, E.K., Nevzorova, O.A.: OntoMathPRO: an ontology of mathematical knowledge. Dokl. Math. 106(3), 429\u2013435 (2022). https:\/\/doi.org\/10.1134\/S1064562422700016","journal-title":"Dokl. Math."},{"key":"27_CR8","doi-asserted-by":"publisher","unstructured":"Fl\u00fcgel, S., Glauer, M., Neuhaus, F., Hastings, J.: When one logic is not enough: integrating first-order annotations in OWL ontologies. Semant. Web J. 1\u201316 (2024). https:\/\/doi.org\/10.3233\/SW-243440","DOI":"10.3233\/SW-243440"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.websem.2008.05.001","volume":"6","author":"BC Grau","year":"2008","unstructured":"Grau, B.C., Horrocks, I., Motik, B., Parsia, B., Patel-Schneider, P., Sattler, U.: OWL 2: the next step for OWL. J. Web Semant. 6(4), 309\u2013322 (2008). https:\/\/doi.org\/10.1016\/j.websem.2008.05.001","journal-title":"J. Web Semant."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. (1965)","DOI":"10.2307\/1994208"},{"key":"27_CR11","unstructured":"Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible SROIQ. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR2006), pp. 57\u201367. AAAI Press (2006)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Huang, L., et al.: A survey on hallucination in large language models: principles, taxonomy, challenges, and open questions (2023). https:\/\/arxiv.org\/abs\/2311.05232","DOI":"10.1145\/3703155"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Huguet\u00a0Cabot, P.L., Navigli, R.: REBEL: relation extraction by end-to-end language generation. In: Findings of the Association for Computational Linguistics: EMNLP 2021, pp. 2370\u20132381. Association for Computational Linguistics, Punta Cana, Dominican Republic (2021). https:\/\/aclanthology.org\/2021.findings-emnlp.204","DOI":"10.18653\/v1\/2021.findings-emnlp.204"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Huguet\u00a0Cabot, P.L., Tedeschi, S., Ngonga\u00a0Ngomo, A.C., Navigli, R.: Red$$^{\\rm fm}$$: a filtered and multilingual relation extraction dataset. In: Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics: ACL 2023. Association for Computational Linguistics, Toronto, Canada (2023). https:\/\/arxiv.org\/abs\/2306.09802","DOI":"10.18653\/v1\/2023.acl-long.237"},{"key":"27_CR15","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"27_CR16","doi-asserted-by":"publisher","unstructured":"Keet, C.M., Kutz, O.: Orchestrating a network of mereo(topo)logical theories. In: Proceedings of the 9th Knowledge Capture Conference. K-CAP \u201917. Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3148011.3148013","DOI":"10.1145\/3148011.3148013"},{"key":"27_CR17","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/1-84628-477-5","volume-title":"Theory of Computation","author":"DC Kozen","year":"2006","unstructured":"Kozen, D.C.: Theory of Computation. Texts in Computer Science, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/1-84628-477-5"},{"issue":"2","key":"27_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.3233\/SW-2012-0059","volume":"4","author":"C Lange","year":"2013","unstructured":"Lange, C.: Ontologies and languages for representing mathematical knowledge on the semantic web. Semant. Web 4(2), 119\u2013158 (2013)","journal-title":"Semant. Web"},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1"},{"key":"27_CR20","doi-asserted-by":"publisher","unstructured":"Mateiu, P., Groza, A.: Ontology engineering with large language models. In: 2023 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pp. 226\u2013229. IEEE Computer Society, Los Alamitos, CA, USA (2023). https:\/\/doi.org\/10.1109\/SYNASC61333.2023.00038","DOI":"10.1109\/SYNASC61333.2023.00038"},{"key":"27_CR21","unstructured":"Mossakowski, T., Kutz, O., Codescu, M., Lange, C.: The distributed ontology, modeling and specification language. In: Vescovo, C.D., Hahmann, T., Pearce, D., Walther, D. (eds.) Proceedings of the 7th International Workshop on Modular Ontologies Co-located with the 12th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2013), Corunna, Spain, 15 September 2013. CEUR Workshop Proceedings, vol.\u00a01081. CEUR-WS.org (2013). http:\/\/ceur-ws.org\/Vol-1081\/womo2013_invited_paper_1.pdf"},{"key":"27_CR22","doi-asserted-by":"publisher","unstructured":"Musen, M.A.: The Prot\u00e9g\u00e9 project: a look back and a look forward. AI Matters 1(4), 4\u201312 (2015). https:\/\/doi.org\/10.1145\/2757001.2757003","DOI":"10.1145\/2757001.2757003"},{"key":"27_CR23","unstructured":"OpenAI: GPT-4 Technical report (2024)"},{"key":"27_CR24","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2,3), 91\u2013110 (2002)"},{"key":"27_CR25","doi-asserted-by":"publisher","unstructured":"Rudolph, S.: Foundations of Description Logics, pp. 76\u2013136. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23032-5_2","DOI":"10.1007\/978-3-642-23032-5_2"},{"key":"27_CR26","unstructured":"Sack, H.: Npbibsearch - an ontology augmented bibliographic search. In: Bouquet, P., Tummarello, G. (eds.) SWAP 2005 - Semantic Web Applications and Perspectives, Proceedings of the 2nd Italian Semantic Web Workshop, University of Trento, Trento, Italy, 14\u201316 December 2005. CEUR Workshop Proceedings, vol.\u00a0166. CEUR-WS.org (2005). https:\/\/ceur-ws.org\/Vol-166\/28.pdf"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-031-60626-7_8","volume-title":"The Semantic Web","author":"MJ Saeedizade","year":"2024","unstructured":"Saeedizade, M.J., Blomqvist, E.: Navigating ontology development with large language models. In: Mero\u00f1o Pe\u00f1uela, A., et al. (eds.) ESWC 2024. LNCS, vol. 14664, pp. 143\u2013161. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-60626-7_8"},{"key":"27_CR28","unstructured":"Schena, I., Asperti, A.: Towards a semantic web for formal mathematics. Ph.D. thesis (2002)"},{"key":"27_CR29","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Course Technology, Boston (2013)"},{"key":"27_CR30","doi-asserted-by":"publisher","unstructured":"Sousa, D., Lamurias, A., Couto, F.M.: Using Neural Networks for Relation Extraction from Biomedical Literature, pp. 289\u2013305. Springer, New York (2021). https:\/\/doi.org\/10.1007\/978-1-0716-0826-5_14","DOI":"10.1007\/978-1-0716-0826-5_14"},{"key":"27_CR31","unstructured":"Team, G.: Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context (2024). https:\/\/arxiv.org\/abs\/2403.05530"},{"key":"27_CR32","unstructured":"Team, G.: Gemini: A family of highly capable multimodal models (2024). https:\/\/arxiv.org\/abs\/2312.11805"},{"key":"27_CR33","unstructured":"Touvron, H., et al.: Llama: open and efficient foundation language models (2023). https:\/\/arxiv.org\/abs\/2302.13971"},{"key":"27_CR34","unstructured":"Touvron, H., et al.: Llama 2: open foundation and fine-tuned chat models (2023). https:\/\/arxiv.org\/abs\/2307.09288"},{"key":"27_CR35","doi-asserted-by":"publisher","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. s2-42(1), 230\u2013265 (1937). https:\/\/doi.org\/10.1112\/PLMS\/S2-42.1.230","DOI":"10.1112\/PLMS\/S2-42.1.230"},{"key":"27_CR36","unstructured":"CoQ proof assistant. https:\/\/coq.inria.fr"},{"key":"27_CR37","unstructured":"GPT4-o web page. https:\/\/openai.com\/index\/hello-gpt-4o\/"},{"key":"27_CR38","unstructured":"HELM. http:\/\/helm.cs.unibo.it"},{"key":"27_CR39","unstructured":"Hermit reasoner. http:\/\/www.hermit-reasoner.com"},{"key":"27_CR40","unstructured":"Math-net. http:\/\/www.math-net.org"},{"key":"27_CR41","unstructured":"OMDoc Project. http:\/\/omdoc.org"},{"key":"27_CR42","doi-asserted-by":"publisher","unstructured":"Vereschchagin, N.: On the power of pp. In: [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pp. 138\u2013143 (1992). https:\/\/doi.org\/10.1109\/SCT.1992.215389","DOI":"10.1109\/SCT.1992.215389"},{"key":"27_CR43","doi-asserted-by":"publisher","unstructured":"Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 537\u2013546 (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892141","DOI":"10.1109\/SFCS.2000.892141"},{"key":"27_CR44","unstructured":"Zhao, et al.: A survey of large language models (2023). https:\/\/arxiv.org\/abs\/2303.18223"}],"container-title":["Lecture Notes in Computer Science","Knowledge Engineering and Knowledge Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-77792-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T07:06:37Z","timestamp":1732259197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-77792-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,20]]},"ISBN":["9783031777912","9783031777929"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-77792-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,20]]},"assertion":[{"value":"20 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EKAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Engineering and Knowledge Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"25 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ekaw2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/event.cwi.nl\/ekaw2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}