{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:01Z","timestamp":1753894381117,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T00:00:00Z","timestamp":1632096000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We propose a new approach to querying graph databases. Our approach balances\ncompeting goals of expressive power, language clarity and computational\ncomplexity. A distinctive feature of our approach is the ability to express\nproperties of minimal (e.g. shortest) and maximal (e.g. most valuable) paths\nsatisfying given criteria. To express complex properties in a modular way, we\nintroduce labelling-generating ontologies. The resulting formalism is\ncomputationally attractive - queries can be answered in non-deterministic\nlogarithmic space in the size of the database.<\/jats:p>","DOI":"10.46298\/lmcs-17(3:27)2021","type":"journal-article","created":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T13:56:43Z","timestamp":1632146203000},"source":"Crossref","is-referenced-by-count":0,"title":["Modular Path Queries with Arithmetic"],"prefix":"10.46298","volume":"Volume 17, Issue 3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5053-0347","authenticated-orcid":false,"given":"Jakub","family":"Michaliszyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8804-8011","authenticated-orcid":false,"given":"Jan","family":"Otop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6146-603X","authenticated-orcid":false,"given":"Piotr","family":"Wieczorek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2021,9,20]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8503\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8503\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:17:34Z","timestamp":1687292254000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6091"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,20]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-17(3:27)2021","relation":{"has-preprint":[{"id-type":"arxiv","id":"2002.04460v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2002.04460v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2002.04460v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2002.04460","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2002.04460","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2021,9,20]]},"article-number":"6091"}}