Graph database models can be defined as those in which data structures for the schema
and instances are modeled as graphs or generalizations of them, and data manipulation is …

RDF is a knowledge representation language dedicated to the annotation of resources
within the framework of the semantic web. Among the query languages for RDF, SPARQL …

Graph databases have received much attention as of late due to numerous applications in
which data is naturally viewed as a graph; these include social networks, RDF and the …

XPath plays a prominent role as an XML navigational language due to several factors,
including its ability to express queries of interest, its close connection to yardstick database …

XPath 1.0 is a variable free language designed to specify paths between nodes in XML
documents. Such paths can alternatively be specified in first-order logic. The logical …

This paper is about the W3C standard node-addressing language for XML documents,
called XPath. XPath is still under development. Version 2.0 appeared in 2001 while the …

We investigate the complexity of the model checking problem for hybrid logics. We provide
model checking algorithms for various hybrid fragments and we prove PSPACE …

We investigate the complexity of satisfiability for finite-variable fragments of propositional
dynamic logics (PDLs). We consider three formalisms belonging to three representative …

We introduce the Extended Modal Logic EML with regularity constraints and full Presburger
constraints on the number of children that generalize graded modalities, also known as …

This paper is about a special version of PDL, proposed by Marcus Kracht, for reasoning
about sibling ordered trees. It has four basic programs corresponding to the child, parent, left …