Graph logics with rational relations: the role of word combinatorics
DOI10.1145/2603088.2603122zbMATH Open1391.68026OpenAlexW2100876674WikidataQ130888052 ScholiaQ130888052MaRDI QIDQ4635595FDOQ4635595
Authors: Pablo Barceló, Pablo R. Muñoz
Publication date: 23 April 2018
Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2603088.2603122
Recommendations
shuffleword equationsregular path queriesrational relationslogics for graphscomplexity of evaluation
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Combinatorics on words (68R15) Logic in computer science (03B70)
Cited In (8)
- A term-graph clausal logic: completeness and incompleteness results ★
- Path logics for querying graphs: combining expressiveness and efficiency
- Graph logics with rational relations
- Positive First-order Logic on Words and Graphs
- Graph logics with rational relations: the role of word combinatorics
- Title not available (Why is that?)
- Using Multigraphs to Study the Interaction Between Opposition, Implication and Duality Relations in Logical Squares
- Graph Logics with Rational Relations and the Generalized Intersection Problem
This page was built for publication: Graph logics with rational relations: the role of word combinatorics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635595)