Journal of Intelligent Information Systems - Special issue on methodologies for intelligent systems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Resolution Strategies as Decision Procedures
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Resolution decision procedures
Handbook of automated reasoning
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Speech and Language Processing (2nd Edition)
Speech and Language Processing (2nd Edition)
The Description Logic Handbook
The Description Logic Handbook
Towards portable natural language interfaces to knowledge bases - The case of the ORAKEL system
Data & Knowledge Engineering
Towards Building Robust Natural Language Interfaces to Databases
NLDB '08 Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems
Computer
The Computational Complexity of Quantified Reciprocals
Logic, Language, and Computation
Data-complexity of the two-variable fragment with counting quantifiers
Information and Computation
How useful are natural language interfaces to the semantic web for casual end-users?
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
The data complexity of the syllogistic fragments of English
Proceedings of the 17th Amsterdam colloquium conference on Logic, language and meaning
| Hi-index | 0.00 |
Controlled languages are fragments of natural languages stripped clean of lexical, structural and semantic ambiguity. They have been proposed as a means for providing natural language front-ends to access structured knowledge sources, given that they compositionally and deterministically translate into the (logic-based) formalisms such back-end systems support. An important issue that arises in this context is the semantic data complexity of accessing such information (i.e., the computational complexity of querying measured w.r.t. the number of instances declared in the back-end knowledge base or database). In this paper we study the semantic data complexity of a distinguished family of context-free controlled fragments, viz., Pratt and Third's fragments of English. In doing so, we pinpoint those fragments for which the reasoning problems are tractable (in PTIME) or intractable (NP-hard or CONP-hard).