Introduction

Dear all,

Let me introduce myself, as a member of the WG.
I am associate professor at University of Lille [1], France, and member 
of the Links [2] research team associated with Inria [3].

My main current research is in the domain of theory of databases, in 
particular I'm interested in languages for querying linked data in 
different formats. During my PhD I studied an expressive (logic based) 
language for modelling and querying unordered XML. Following that work I 
recently collaborated on schemas for unordered XML, and also on studying 
the complexity of validation of ShEx [4], which finally lead me to 
joining this WG.

Within the WG, I hope to contribute as a theoretician. As such, I often 
ask myself the same questions, no matter which language (formalism, 
standard, or whatever) is being studied:
- what can be expressed using that language (i.e. its expressiveness), and
- how much does it cost to use that language (i.e. its algorithmic 
complexity, for the problems of interest).

Unfortunately (or fortunately for us, computer-scientists, as this is 
what gives us work to do), it turns out that the expressive languages 
are complex to process. Language design often requires a compromise: 
what primitives to put in a language so that it is expressive enough for 
most of the use cases, but remains easy to process in most of the cases 
? By studying expressiveness and complexity, our aim is to help in 
taking such design decisions.

[1] http://www.univ-lille1.fr/
[2] https://team.inria.fr/links/
[3] http://www.inria.fr/en/centre/lille
[4] http://www.grappa.univ-lille3.fr/~staworko/papers/staworko-icdt15a.pdf

-- 
Iovka Boneva
Associate professor (MdC) Université de Lille
http://www.cristal.univ-lille.fr/~boneva/

Received on Tuesday, 10 February 2015 11:15:25 UTC