Controlled aggregate tree shaped questions over ontologies

Camilo Thorne; Diego Calvanese

doi:10.1007/978-3-642-04957-6_34

Controlled aggregate tree shaped questions over ontologies

Camilo Thorne, Diego Calvanese

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

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 SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.

Original language	English
Title of host publication	Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings
Pages	394-405
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-04957-6_34
State	Published - 2009
Externally published	Yes
Event	8th International Conference on Flexible Query Answering Systems, FQAS 2009 - Roskilde, Denmark Duration: Oct 26 2009 → Oct 28 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5822 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Conference on Flexible Query Answering Systems, FQAS 2009
Country/Territory	Denmark
City	Roskilde
Period	10/26/09 → 10/28/09

Access to Document

10.1007/978-3-642-04957-6_34

Cite this

Thorne, C., & Calvanese, D. (2009). Controlled aggregate tree shaped questions over ontologies. In Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings (pp. 394-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5822 LNAI). https://doi.org/10.1007/978-3-642-04957-6_34

@inproceedings{3de77baf743840bb963a9de2871fdd28,

title = "Controlled aggregate tree shaped questions over ontologies",

abstract = "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 SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.",

author = "Camilo Thorne and Diego Calvanese",

year = "2009",

doi = "10.1007/978-3-642-04957-6_34",

language = "Ingl{\'e}s",

isbn = "3642049567",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "394--405",

booktitle = "Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings",

note = "8th International Conference on Flexible Query Answering Systems, FQAS 2009 ; Conference date: 26-10-2009 Through 28-10-2009",

}

Thorne, C & Calvanese, D 2009, Controlled aggregate tree shaped questions over ontologies. in Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5822 LNAI, pp. 394-405, 8th International Conference on Flexible Query Answering Systems, FQAS 2009, Roskilde, Denmark, 10/26/09. https://doi.org/10.1007/978-3-642-04957-6_34

Controlled aggregate tree shaped questions over ontologies. / Thorne, Camilo; Calvanese, Diego.
Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings. 2009. p. 394-405 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5822 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Controlled aggregate tree shaped questions over ontologies

AU - Thorne, Camilo

AU - Calvanese, Diego

PY - 2009

Y1 - 2009

N2 - 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 SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.

AB - 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 SQL aggregate queries, and study its data complexity w.r.t. several ontology languages and extensions of the query language.

UR - http://www.scopus.com/inward/record.url?scp=70549091297&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-04957-6_34

DO - 10.1007/978-3-642-04957-6_34

M3 - Contribución a la conferencia

AN - SCOPUS:70549091297

SN - 3642049567

SN - 9783642049569

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 394

EP - 405

BT - Flexible Query Answering Systems - 8th International Conference, FQAS 2009, Proceedings

T2 - 8th International Conference on Flexible Query Answering Systems, FQAS 2009

Y2 - 26 October 2009 through 28 October 2009

ER -

Controlled aggregate tree shaped questions over ontologies

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this