Tractability and Intractability of Controlled Languages for Data Access

Camilo Thorne and Diego Calvanese

Studia Logica. 100(4):787--813 2012.

In this paper we study the semantic data complexity of several controlled fragments of English designed for natural language front-ends to OWL (Web Ontology Language) and description logic ontology-based systems. Controlled languages are fragments of natural languages, obtained by restricting natural language syntax and vocabulary with the goal of eliminating ambiguity. Semantic complexity arises from the formal logic modelling of meaning in natural language and fragments thereof. It can be characterized as the computational complexity of the reasoning problems associated to their semantic representations. Data complexity (the complexity of answering a question over an ontology, stated in terms of the data items stored therein), in particular, provides a measure of the scalability of controlled languages to ontologies, since tractable data complexity implies scalability of data access. We present maximal tractable controlled languages and minimal intractable controlled languages.

   title = "Tractability and Intractability of Controlled Languages for Data
   year = "2012",
   author = "Camilo Thorne and Diego Calvanese",
   journal = "Studia Logica",
   pages = "787--813",
   number = "4",
   volume = "100",
   doi = "10.1007/s11225-012-9430-y",
pdf url