{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:56:36Z","timestamp":1743080196936,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030937577"},{"type":"electronic","value":"9783030937584"}],"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-93758-4_19","type":"book-chapter","created":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T18:05:41Z","timestamp":1641492341000},"page":"184-195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Univalent Foundations of AGI are (not) All You Need"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Potapov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Bogdanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,6]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/360018.360022","volume":"19","author":"A Newell","year":"1976","unstructured":"Newell, A., Simon, H.A.: Computer science as empirical inquiry: symbols and search. Commun. ACM 19(3), 113\u2013126 (1976). https:\/\/doi.org\/10.1145\/360018.360022","journal-title":"Commun. ACM"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1093\/oso\/9780198853404.001.0001","volume-title":"Modal Homotopy Type Theory: The Prospect of a New Logic for Philosophy","author":"D Corfield","year":"2020","unstructured":"Corfield, D.: Modal Homotopy Type Theory: The Prospect of a New Logic for Philosophy, p. 191. Oxford University Press, Oxford (2020)"},{"key":"19_CR3","unstructured":"Homotopy Type Theory: Univalent Foundations of Mathematics (2013). arXiv preprint, arXiv: 1308.0729"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-63703-7_2","volume-title":"Artificial General Intelligence","author":"B Goertzel","year":"2017","unstructured":"Goertzel, B.: A formal model of cognitive synergy. In: Everitt, T., Goertzel, B., Potapov, A. (eds.) AGI 2017. LNCS (LNAI), vol. 10414, pp. 13\u201322. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63703-7_2"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-319-63703-7_6","volume-title":"Artificial General Intelligence","author":"S Phillips","year":"2017","unstructured":"Phillips, S.: A general (category theory) principle for general intelligence: duality (adjointness). In: Everitt, T., Goertzel, B., Potapov, A. (eds.) AGI 2017. LNCS (LNAI), vol. 10414, pp. 57\u201366. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63703-7_6"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Lamb, L.C., et al.: Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective (2021). arXiv preprint, arXiv: 2003.00330","DOI":"10.24963\/ijcai.2020\/679"},{"key":"19_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09274-4","volume-title":"Engineering General Intelligence, Part 1 & 2","author":"B Goertzel","year":"2014","unstructured":"Goertzel, B., Pennachin, C., Geisweiller, N.: Engineering General Intelligence, Part 1 & 2. Atlantis press, Paris (2014)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-030-27005-6_15","volume-title":"Artificial General Intelligence","author":"A Potapov","year":"2019","unstructured":"Potapov, A., Belikov, A., Bogdanov, V., Scherbatiy, A.: Cognitive module networks for grounded reasoning. In: Hammer, P., Agrawal, P., Goertzel, B., Ikl\u00e9, M. (eds.) AGI 2019. LNCS (LNAI), vol. 11654, pp. 148\u2013158. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27005-6_15"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-25975-3_23","volume-title":"Knowledge Science, Engineering and Management","author":"R Dapoigny","year":"2011","unstructured":"Dapoigny, R., Barlatier, P.: Using a dependently-typed language for expressing ontologies. In: Xiong, H., Lee, W.B. (eds.) KSEM 2011. LNCS (LNAI), vol. 7091, pp. 257\u2013268. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25975-3_23"},{"key":"19_CR10","unstructured":"Lai, Z., et al.: Dependently Typed Knowledge Graphs (2020). arXiv preprint, arXiv: 2003.03785"},{"key":"19_CR11","unstructured":"Goertzel, B.: Distinction Graphs and Graphtropy: A Formalized Phenomenological Layer Underlying Classical and Quantum Entropy, Observational Semantics and Cognitive Computation (2019). arXiv preprint, arXiv: 1902.00741"},{"key":"19_CR12","unstructured":"Legg, Sh.: Machine Super Intelligence. PhD thesis (2008)"},{"issue":"2","key":"19_CR13","first-page":"1","volume":"19","author":"P Wang","year":"2019","unstructured":"Wang, P.: On definition of artificial intelligence. J. Artif. Gen. Intell. 19(2), 1\u201337 (2019)","journal-title":"J. Artif. Gen. Intell."},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Schmidhuber, J.: G\u00f6del machines: fully self-referential optimal universal self-improvers. In: Goertzel, B., Pennachin. C. (eds.) Artificial General Intelligence. Cognitive Technologies, pp. 199\u2013226. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-68677-4_7","DOI":"10.1007\/978-3-540-68677-4_7"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93758-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T13:25:13Z","timestamp":1651238713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93758-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030937577","9783030937584"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93758-4_19","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":"6 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial General Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 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":"agi2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agi-conf.org\/2021\/","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":"50","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":"36","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":"72% - 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.6","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.8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}