Controlled Aggregate Tree Shaped Questions over Ontologies

Proc. of the 8th Int. Conf. on Flexible Query Answering Systems (FQAS 2009). Volume 5822 of Lecture Notes in Computer Science. 2009.

Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query languages and the intuitive appeal of natural language. They compositionally map (modulo a compositional translation) into (or express) formal query languages and ontology languages. Modulo compositionality, they inherit the computational properties of such ontology/query languages. In the setting of OBDAS, we are interested in capturing query answering and measuring computational complexity w.r.t. the data queried (a.k.a. data complexity). In this paper we focus in defining a CL capable of expressing a subset of SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.

@inproceedings{FQAS-2009,
   title = "Controlled Aggregate Tree Shaped Questions over Ontologies",
   year = "2009",
   author = "Camilo Thorne and Diego Calvanese",
   booktitle = "Proc. of the 8th Int. Conf. on Flexible Query Answering
Systems (FQAS 2009)",
   pages = "394--405",
   volume = "5822",
   publisher = "Springer",
   series = "Lecture Notes in Computer Science",
   doi = "10.1007/978-3-642-04957-6_34",
}