Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Handbook on Ontologies (International Handbooks on Information Systems)
Handbook on Ontologies (International Handbooks on Information Systems)
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
The Description Logic Handbook
The Description Logic Handbook
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Journal of Automated Reasoning
The DL-lite family and relations
Journal of Artificial Intelligence Research
Data complexity in the ƐL family of description logics
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Bidirectional mapping between OWL DL and attempto controlled english
PPSWR'06 Proceedings of the 4th international conference on Principles and Practice of Semantic Web Reasoning
Interactive natural language query construction for report generation
INLG '12 Proceedings of the Seventh International Natural Language Generation Conference
| Hi-index | 0.00 |
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, vocabulary and semantics 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.