The data complexity of the syllogistic fragments of English

DOI10.1007/978-3-642-14287-1_12MaRDI QIDQ4933252zbMATH OpenOpenAlexWikidataFDO

Authors Camilo Thorne, Diego Calvanese

Publication date 12 October 2010

Published in Logic, Language and Meaning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14287-1_12

Mathematics Subject Classification ID

Logic of natural languages (03B65) Analysis of algorithms and problem complexity (68Q25) Natural language processing (68T50)

Recommendations

• Querying the fragments of English
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
• Fragments of language
• More fragments of language.
• Terminological reasoning is inherently intractable

Cited in

(4)

• A system of relational syllogistic incorporating full Boolean reasoning
• Querying the fragments of English
• Modal syllogistic
• Tractability and intractability of controlled languages for data access

This page was built for publication: The data complexity of the syllogistic fragments of English

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