1 citations · 1 across the 4 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2020
Modular Path Queries with Arithmetic
Jakub Michaliszyn, Jan Otop, Piotr Wieczorek
We propose a new approach to querying graph databases. Our approach balances competing goals of expressive power, language clarity and computational complexity. A distinctive featu…
cs.LO2018
Containment of Shape Expression Schemas for RDF
Slawek Staworko, Piotr Wieczorek
We study the problem of containment for shape expression schemas (ShEx) for RDF graphs. We identify a subclass of ShEx that has a natural graphical representation in the form of sh…