{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T05:59:58Z","timestamp":1790315998368,"version":"4.1.0"},"reference-count":40,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T00:00:00Z","timestamp":1790294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100016917","name":"Scottish Enterprise","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100016917","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Artif. Intell."],"abstract":"<jats:sec>\n                    <jats:title>Introduction<\/jats:title>\n                    <jats:p>Knowledge representation remains a central challenge for reasoning-centered artificial intelligence, particularly when semantic structures involve relations over relations, contextual annotations, and recursively nested descriptions. This paper introduces Views, a recursively labeled graph database (GDB) model designed to represent such graph-structured knowledge within a uniform graph abstraction while retaining a hardware-aware organization for associative search and traversal.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Methods<\/jats:title>\n                    <jats:p>The model refactors directed labeled graphs into linked-list-like chains of linknodes, supports recursive labeling of vertices and edges, and admits mappings from Resource Description Framework (RDF)- and labeled property graph (LPG)-style graph representations. We describe the data structure, its hardware-oriented memory mappings under the Associative Chip Architecture (ASOCA), and selected associative operations for retrieval over Views-based GDBs. We then evaluate storage footprint under stated mapping and store boundaries using three scales of the Social Network Benchmark published by the Linked Data Benchmark Council, and characterize directed K-hop traversal on an Associative Memory Chip III (ASOCA3) field-programmable gate array (FPGA) implementation.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>The storage results show that allocation and entry width materially affect the reported footprints rather than establishing an intrinsic advantage for Views, while the K-hop measurements show increasing mean returned-vertex count and mean latency with hop bound over the fixed resident graph image. Worked semantic-reasoning and Copycat-inspired examples further illustrate how retrieval operations can be composed over the model, rather than providing application-level reasoning or cognitive validation.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Discussion<\/jats:title>\n                    <jats:p>Taken together, these results position Views as a model-architecture co-design for associative storage and selected graph traversal under the stated conditions; broader database workloads and end-to-end reasoning applications remain to be evaluated.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.3389\/frai.2026.1874897","type":"journal-article","created":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T05:33:06Z","timestamp":1790314386000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Views: a hardware-aware recursively labeled graph database model for knowledge representation and reasoning"],"prefix":"10.3389","volume":"9","author":[{"given":"Yanjun","family":"Yang","sequence":"first","affiliation":[{"name":"Centre for Electronics Frontiers, Institute for Integrated Micro and Nano Systems, School of Engineering, University of Edinburgh","place":["Edinburgh, United Kingdom"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Wheeldon","sequence":"additional","affiliation":[{"name":"Literal Labs","place":["Newcastle upon Tyne, United Kingdom"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yihan","family":"Pan","sequence":"additional","affiliation":[{"name":"Centre for Electronics Frontiers, Institute for Integrated Micro and Nano Systems, School of Engineering, University of Edinburgh","place":["Edinburgh, United Kingdom"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alex","family":"Serb","sequence":"additional","affiliation":[{"name":"Centre for Electronics Frontiers, Institute for Integrated Micro and Nano Systems, School of Engineering, University of Edinburgh","place":["Edinburgh, United Kingdom"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1965","published-online":{"date-parts":[[2026,9,25]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.59543\/ysxskx89","article-title":"Structural properties of N-fuzzy graphs with applications to bridges, cut nodes, and trees","volume":"1","author":"Ali","year":"2026","journal-title":"Appl. Expert Syst. Knowl. Manage"},{"key":"B2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1207\/s15516709cog2601_2","article-title":"Memory for goals: an activation-based model","volume":"26","author":"Altmann","year":"2002","journal-title":"Cogn. Sci"},{"key":"B3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/cogp.1996.0007","article-title":"Working memory: activation limitations on retrieval","volume":"30","author":"Anderson","year":"1996","journal-title":"Cogn. Psychol"},{"key":"B4","unstructured":"The LDBC social network benchmark\n          \n          \n            \n              Angles\n              R.\n            \n            \n              Antal\n              J. B.\n            \n            \n              Averbuch\n              A.\n            \n            \n              Birler\n              A.\n            \n            \n              Boncz\n              P.\n            \n            \n              B\u00far\n              M.\n            \n          \n          arXiv\n          \n          2020"},{"key":"B5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3104031","article-title":"Foundations of modern query languages for graph databases","volume":"50","author":"Angles","year":"2017","journal-title":"ACM Comput. Surv"},{"key":"B6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1322432.1322433","article-title":"Survey of graph database models","volume":"40","author":"Angles","year":"2008","journal-title":"ACM Comput. Surv"},{"key":"B7","first-page":"17","article-title":"\u201cFast parallel conversion of edge list to adjacency list for large-scale graphs,\u201d","volume-title":"Proceedings of the symposium on high performance computing","author":"Arifuzzaman","year":"2015"},{"key":"B8","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/2463664.2465216","article-title":"\u201cQuerying graph databases,\u201d","author":"Barcel\u00f3 Baeza","year":"2013","journal-title":"Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems"},{"key":"B9","doi-asserted-by":"publisher","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp"},{"key":"B10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0004-3702(77)90014-5","article-title":"Directed recursive labelnode hypergraphs: a new representation-language","volume":"9","author":"Boley","year":"1977","journal-title":"Artif. Intell"},{"key":"B11","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/507533.507536","article-title":"Resource description framework: metadata and its applications","volume":"3","author":"Candan","year":"2001","journal-title":"ACM SIGKDD Explor. Newsl"},{"key":"B12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1037\/0033-295X.82.6.407","article-title":"A spreading-activation theory of semantic processing","volume":"82","author":"Collins","year":"1975","journal-title":"Psychol. Rev"},{"key":"B13","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/ICSC.2010.28","article-title":"\u201cSemantic summarization of web documents,\u201d","author":"d'Acierno","year":"2010","journal-title":"2010 IEEE fourth international conference on semantic computing"},{"key":"B14","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/3544585.3544600","article-title":"\u201cA note on two problems in connexion with graphs,\u201d","author":"Dijkstra","year":"2022","journal-title":"Edsger Wybe Dijkstra: His Life, Work, and Legacy"},{"key":"B15","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-16720-1_4","article-title":"\u201cSurvey of graph database performance on the hpc scalable graph analysis benchmark,\u201d","author":"Dominguez-Sal","year":"2010","journal-title":"International conference on web-age information management"},{"key":"B16","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1145\/2723372.2742786","article-title":"\u201cThe LDBC social network benchmark: Interactive workload,\u201d","author":"Erling","year":"2015","journal-title":"Proceedings of the 2015 ACM SIGMOD international conference on management of data"},{"key":"B17","doi-asserted-by":"publisher","first-page":"85","DOI":"10.59543\/br0t5084","article-title":"Complex hesitant fuzzy set-based multi-criteria decision-making using hamacher aggregation operators","volume":"1","author":"Farooq","year":"2026","journal-title":"Appl. Expert Syst. Knowl. Manage"},{"key":"B18","first-page":"665","article-title":"The subtlety of sameness","volume":"7","author":"French","year":"1996","journal-title":"Int. J. Neural Syst"},{"key":"B19","unstructured":"Retrieval-augmented generation for large language models: a survey\n          \n          \n            \n              Gao\n              Y.\n            \n            \n              Xiong\n              Y.\n            \n            \n              Gao\n              X.\n            \n            \n              Jia\n              K.\n            \n            \n              Pan\n              J.\n            \n            \n              Bi\n              Y.\n            \n          \n          arXiv\n          \n          2023"},{"key":"B20","volume-title":"Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mechanisms of Thought","author":"Hofstadter","year":"1995"},{"key":"B21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447772","article-title":"Knowledge graphs","volume":"54","author":"Hogan","year":"2021","journal-title":"ACM Comput. Surv"},{"key":"B22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","article-title":"A survey of frequent subgraph mining algorithms","volume":"28","author":"Jiang","year":"2013","journal-title":"Knowl. Eng. Rev"},{"key":"B23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cogsys.2006.07.004","article-title":"Cognitive architectures: research issues and challenges","volume":"10","author":"Langley","year":"2009","journal-title":"Cogn. Syst. Res"},{"key":"B24","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-30284-8_36","article-title":"\u201cExchange and consumption of huge rdf data,\u201d","author":"Mart\u00ednez-Prieto","year":"2012","journal-title":"Extended semantic web conference"},{"key":"B25","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive functions of symbolic expressions and their computation by machine, part I","volume":"3","author":"McCarthy","year":"1960","journal-title":"Commun. ACM"},{"key":"B26","volume-title":"Analogy-Making as Perception: A Computer Model","author":"Mitchell","year":"1993"},{"key":"B27","first-page":"687","article-title":"\u201cI\/O-complexity of graph algorithms,\u201d","volume-title":"Proceedings of the tenth annual ACM-SIAM symposium on discrete algorithms","author":"Munagala","year":"1999"},{"key":"B28","doi-asserted-by":"publisher","first-page":"252","DOI":"10.59543\/fwf39211","article-title":"Vertex betweenness centrality of some graph classes with applications","volume":"2","author":"Nandi","year":"2026","journal-title":"Intell. Syst. Res. Appl. J"},{"key":"B29","first-page":"226","article-title":"\u201cComprehensive working memory activation in soar,\u201d","volume-title":"Sixth international conference on cognitive modeling","author":"Nuxoll","year":"2004"},{"key":"B30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3543508","article-title":"Semantic knowledge graphs for the news: a review","volume":"55","author":"Opdahl","year":"2022","journal-title":"ACM Comput. Surv"},{"key":"B31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/ISCAS51556.2021.9401296","article-title":"A RRAM-based associative memory cell,\u201d","volume-title":"2021 IEEE international symposium on circuits and systems (ISCAS)","author":"Pan","year":"2021"},{"key":"B32","doi-asserted-by":"publisher","first-page":"5285","DOI":"10.1109\/TCSI.2024.3451707","article-title":"An energy-efficient capacitive-RRAM content addressable memory","volume":"71","author":"Pan","year":"2024","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"B33","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.11591\/ijece.v8i2.pp1140-1149","article-title":"A survey on graph database management techniques for huge unstructured data","volume":"8","author":"Patil","year":"2018","journal-title":"Int. J. Electr. Comput. Eng"},{"key":"B34","doi-asserted-by":"crossref","DOI":"10.1145\/1476793.1476930","article-title":"\u201cA hierarchical graph model of the semantics of programs,\u201d","volume-title":"Proceedings of the May 14-16, 1969, spring joint computer conference","author":"Pratt","year":"1969"},{"key":"B35","doi-asserted-by":"publisher","first-page":"40","DOI":"10.59543\/g8c2gg51","article-title":"\u03b1-domination in fuzzy graphs with applications to fake news control","volume":"2","author":"Rana","year":"2026","journal-title":"Intell. Syst. Res. Appl. J"},{"key":"B36","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1038\/nature06932","article-title":"The missing memristor found","volume":"453","author":"Strukov","year":"2008","journal-title":"Nature"},{"key":"B37","doi-asserted-by":"publisher","first-page":"1887","DOI":"10.1145\/2723372.2723732","article-title":"\u201cSqlgraph: an efficient relational-based property graph store,\u201d","author":"Sun","year":"2015","journal-title":"Proceedings of the 2015 ACM SIGMOD international conference on management of data"},{"key":"B38","doi-asserted-by":"publisher","first-page":"3621","DOI":"10.1007\/s10618-024-01053-8","article-title":"Explainable decomposition of nested dense subgraphs","volume":"38","author":"Tatti","year":"2024","journal-title":"Data Mining Knowl. Discov"},{"key":"B39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3177850","article-title":"RDF data storage and query processing schemes: a survey","volume":"51","author":"Wylot","year":"2018","journal-title":"ACM Comput. Surv"},{"key":"B40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.5808\/GI.2017.15.1.19","article-title":"Use of graph database for the integration of heterogeneous biological data","volume":"15","author":"Yoon","year":"2017","journal-title":"Genomics Inform"}],"container-title":["Frontiers in Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2026.1874897\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T05:33:10Z","timestamp":1790314390000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/frai.2026.1874897\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,25]]},"references-count":40,"alternative-id":["10.3389\/frai.2026.1874897"],"URL":"https:\/\/doi.org\/10.3389\/frai.2026.1874897","relation":{},"ISSN":["2624-8212"],"issn-type":[{"value":"2624-8212","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,25]]},"article-number":"1874897"}}