Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Type-logical semantics
Knowledge representation: logical, philosophical and computational foundations
Knowledge representation: logical, philosophical and computational foundations
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Description Logic Handbook
The Description Logic Handbook
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
The Complexity of Conjunctive Query Answering in Expressive Description Logics
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Querying ontologies: a controlled english interface for end-users
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
| Hi-index | 0.00 |
As it is well-known, querying and managing structured data in natural language is a challenging task due to its ambiguity (syntactic and semantic) and its expressiveness. On the other hand, querying, e.g., a relational database or an ontology-based data access system is a well-defined and unambigous task, namely, the task of evaluating a formal query (e.g., an SQL query) of a limited expressiveness over such database. However these formal query languages may be difficult to learn and use for the casual user and ambiguity may compromise the interface. To bridge this gap, the use of controlled language interfaces has been proposed. As a measure of their efficiency for data access, we propose to consider data complexity, which is the complexity of query evaluation measured in the size of the data. We study a familiy of controlled languages that express several fragments of OWL, ranging from tractable (LogSpace and PTime) to intractable (coNP-hard) in data complexity, singling out which constructs give rise to each computational property.