Path Logics for Querying Graphs: Combining Expressiveness and Efficiency
From MaRDI portal
Publication:4635815
DOI10.1109/LICS.2015.39zbMath1401.68061MaRDI QIDQ4635815
Diego Figueira, Leonid O. Libkin
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Database theory (68P15) Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)
Related Items (11)
Synchronization of Parikh automata ⋮ On computability of data word functions defined by transducers ⋮ Resynchronizing Classes of Word Relations ⋮ ``Most of leads to undecidability: failure of adding frequencies to LTL ⋮ Decidable weighted expressions with Presburger combinators ⋮ The algebraic theory of Parikh automata ⋮ Graph Logics with Rational Relations ⋮ Closure properties of synchronized relations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Pattern Logic for Automata with Outputs
This page was built for publication: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency