{"type":"ScholarlyArticle","title":"Querying Data Graphs with Arithmetical Regular Expressions","authors":[{"name":"Maciej Grabon","slug":"maciej-grabon","given":"Maciej","family":"Grabon","affiliation":""},{"name":"Jakub Michaliszyn","slug":"jakub-michaliszyn","given":"Jakub","family":"Michaliszyn","affiliation":""},{"name":"Jan Otop","slug":"jan-otop","given":"Jan","family":"Otop","affiliation":""},{"name":"Piotr Wieczorek","slug":"piotr-wieczorek","given":"Piotr","family":"Wieczorek","affiliation":""}],"abstract":"We propose a query language LARE for graphs whose edges are labelled by a finite alphabet and nodes store unbounded data values. LARE is based on a variant of regular expressions with memory. Queries of LARE can compare quantities of memorised graph nodes and their neighbourhoods. These features allow us to express a number of natural properties, while keeping the data complexity (with a query fixed) in non-deterministic logarithmic space. We establish an algorithm that works efficiently not only with LARE, but also with a wider language defined using effective relational conditions, another formalism we propose.","doi":null,"url":"https://ijcai.org/proceedings/2016/158","pdf":"https://ijcai.org/proceedings/2016/0158.pdf","markdown":"https://ijcai.org/proceedings/2016/158.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/158","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":158,"pages":{"first":1088,"last":1093},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}