Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
4 results

Expressive Path Queries on Graph with Data

Pablo Barcelo ; Gaelle Fontaine ; Anthony Widjaja Lin.
Graph data models have recently become popular owing to their applications, e.g., in social networks and the semantic web. Typical navigational query languages over graph databases - such as Conjunctive Regular Path Queries (CRPQs) - cannot express relevant properties of the interaction between the&nbsp;[&hellip;]
Published on October 5, 2015

Order-Invariant Types and Their Applications

Pablo Barcelo ; Leonid Libkin.
Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually dependent on that order relation. This is somewhat surprising since&nbsp;[&hellip;]
Published on April 1, 2016

Graph Logics with Rational Relations

Pablo Barcelo ; Diego Figueira ; Leonid Libkin.
We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying graph topology, which have recently found numerous applications. Such logics use conditions on paths expressed by regular languages&nbsp;[&hellip;]
Published on July 4, 2013

First-Order and Temporal Logics for Nested Words

Rajeev Alur ; Marcelo Arenas ; Pablo Barcelo ; Kousha Etessami ; Neil Immerman ; Leonid Libkin.
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure of parse trees and other tree-structured data, such as XML. We provide new temporal logics for finite and infinite nested&nbsp;[&hellip;]
Published on November 25, 2008

  • < Previous
  • 1
  • Next >