Login / Signup
Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages.
H. J. Sander Bruggink
Mathias Hülsbusch
Published in:
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. (2011)
Keyphrases
</>
expressive power
relational calculus
type checking
description logics
picture languages
databases
structured data
directed graph
query answering
directed acyclic graph
data complexity
finitely representable
database
query language
finite model theory