{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:22:23Z","timestamp":1740169343120,"version":"3.37.3"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Analytical Center for the Government of the Russian Federation in accordance with the subsidy agreement","award":["000000D730321P5Q0002"],"award-info":[{"award-number":["000000D730321P5Q0002"]}]},{"DOI":"10.13039\/501100002674","name":"Ivannikov Institute for System Programming of the Russian Academy of Sciences","doi-asserted-by":"publisher","award":["70-2021-00142"],"award-info":[{"award-number":["70-2021-00142"]}],"id":[{"id":"10.13039\/501100002674","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3305272","type":"journal-article","created":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T17:56:40Z","timestamp":1692035800000},"page":"88074-88086","source":"Crossref","is-referenced-by-count":5,"title":["Comparative Analysis of Logic Reasoning and Graph Neural Networks for Ontology-Mediated Query Answering With a Covering Axiom"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3598-7701","authenticated-orcid":false,"given":"Olga","family":"Gerasimova","sequence":"first","affiliation":[{"name":"School of Data Analysis and Artificial Intelligence, HSE University, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikita","family":"Severin","sequence":"additional","affiliation":[{"name":"School of Data Analysis and Artificial Intelligence, HSE University, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3308-8825","authenticated-orcid":false,"given":"Ilya","family":"Makarov","sequence":"additional","affiliation":[{"name":"ISP RAS Research Center for Trusted Artificial Intelligence, Moscow, Russia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2020\/41"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3122100"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103808"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.858"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2757001.2757003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25010-6_1"},{"key":"ref36","article-title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","author":"platonov","year":"2023","journal-title":"arXiv 2302 11640"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"ref30","volume":"1","author":"dolata","year":"2014","journal-title":"Czy Szko?a ma Znaczenie? Analiza Zró?nicowania Efektywno?ci Nauczania na Pierwszym Etapie Edukacyjnym"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103709"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.526"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20534"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69548-8_11"},{"key":"ref1","first-page":"1","article-title":"On the data complexity of ontology-mediated queries with a covering axiom","volume":"1879","author":"gerasimova","year":"2017","journal-title":"Proc 30th Int Workshop Description Logics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3233\/SW-160217"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref16","first-page":"1","article-title":"The SWRLTab: An extensible environment for working with SWRL rules in protégé-OWL","author":"o\u2019connor","year":"2006","journal-title":"Proc 2nd Int Conf Rules Rule Markup Lang Semantic Web"},{"key":"ref38","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"zhu","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2007.03.004"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-014-9305-1"},{"key":"ref24","first-page":"1025","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"arXiv 1609 02907"},{"key":"ref26","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"pei","year":"2020","journal-title":"arXiv 2002 05287"},{"key":"ref25","article-title":"Graph attention networks","author":"veli?kovi?","year":"2017","journal-title":"arXiv 1710 10903"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45757-7_50"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.357"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068418000054"},{"key":"ref28","article-title":"Exploiting neighbor effect: Conv-Agnostic GNNs framework for graphs with heterophily","author":"chen","year":"2022","journal-title":"arXiv 2203 11200"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16514"},{"key":"ref29","article-title":"When do graph neural networks help with node classification: Investigating the homophily principle on node distinguishability","author":"luan","year":"2023","journal-title":"arXiv 2304 14274"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-007-9078-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77688-8_5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355"},{"key":"ref4","article-title":"Query2box: Reasoning over knowledge graphs in vector space using box embeddings","author":"ren","year":"2020","journal-title":"arXiv 2002 05969"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103738"},{"key":"ref6","first-page":"19172","article-title":"ConE: Cone embeddings for multi-hop reasoning over knowledge graphs","volume":"34","author":"zhang","year":"2021","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","article-title":"Logic embeddings for complex query answering","author":"luus","year":"2021","journal-title":"arXiv 2103 00418"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/17517575.2022.2062683"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10216983.pdf?arnumber=10216983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T18:08:33Z","timestamp":1695060513000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10216983\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3305272","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2023]]}}}