The Data Complexity of the Syllogistic Fragments of English

Abstract. Pratt and Third's syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in particular (i) knowledge base consistency and (ii) knowledge base query answering, modulo their FO semantic representations. We show how difficult, in terms of semantic (computational) complexity and data complexity (i.e., computational complexity w.r.t. the number of instances declared in a knowledge base), such reasoning problems are. In doing so, we pinpoint also those fragments for which the reasoning problems are tractable (in PTime) or intractable (NP-hard or coNP-hard).

• Type: Journal
• Year: 2009
• Where: AMSTERDAM
• Authors: Camilo Thorne, Diego Calvanese
• Keywords: AMSTERDAM 2009, Knowledge Base, Logical Reasoning, Reasoning, Reasoning Problems