Maciej Grabon

Czech Academy of Sciences, Institute of Computer Science

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Jan Otop

University of Wrocław

Piotr Wieczorek

University of Opole

Jakub Michaliszyn

University of Wrocław

Cooperative Institutions

University of Wrocław

Institute of Computer Science

Czech Academy of Sciences, Institute of Computer Science

Institute of Science and Technology Austria

ORCID

University of Opole

Institute of Ceramics and Building Materials

Instytut Oceanologii Polskiej Akademii Nauk

Polish Academy of Sciences

Medical University of Silesia

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Querying data graphs with arithmetical regular expressions

International Joint Conference on Artificial Intelligence (2016)

Maciej Grabon Jakub Michaliszyn Jan Otop Piotr Wieczorek

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.

Arithmetic function

Formalism (music)

Regular expression

Regular language

Source

Cite

Citations (1)