Tractability and intractability of controlled languages for data access

DOI10.1007/S11225-012-9430-YMaRDI QIDQ692195zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Camilo Thorne, Diego Calvanese

Publication date 4 December 2012

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11225-012-9430-y

zbMATH Keywords

query answeringcontrolled language interfaces to description logic ontologiescontrolled languagessemantic data complexity

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic of natural languages (03B65) Natural language processing (68T50)

Recommendations

• Querying the fragments of English
• A two-variable fragment of English
• The data complexity of the syllogistic fragments of English
• Fragments of language
• More fragments of language.

Cites work

• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Data Complexity in the $\mathcal{EL}$ Family of Description Logics
• Data complexity of query answering in description logics
• Data complexity of query answering in expressive description logics via tableaux
• Generalized quantifiers and natural language
• More fragments of language.
• The DL-Lite Family and Relations
• The Description Logic Handbook
• Tractability and intractability of controlled languages for data access
• Universal grammar

Cited in

(4)

• Tractability and intractability of controlled languages for data access
• A principled approach to grammars for controlled natural languages and predictive editors
• Designing efficient controlled languages for ontologies
• Querying the fragments of English

This page was built for publication: Tractability and intractability of controlled languages for data access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q692195)