Tractability and intractability of controlled languages for data access

DOI10.1007/S11225-012-9430-YzbMATH Open1252.03073DBLPjournals/sLogica/ThorneC12OpenAlexW2024902016WikidataQ64360046 ScholiaQ64360046MaRDI QIDQ692195FDOQ692195

Diego Calvanese, Camilo Thorne

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)

Cites Work

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

Cited In (2)

• Tractability and intractability of controlled languages for data access
• Designing efficient controlled languages for ontologies

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)