The Data Complexity of the Syllogistic Fragments of English

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).

[1]  James H. Martin,et al.  Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition, 2nd Edition , 2000, Prentice Hall series in artificial intelligence.

[2]  James H. Martin,et al.  Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition , 2000 .

[3]  Christian G. Fermüller,et al.  Resolution Decision Procedures , 2001, Handbook of Automated Reasoning.

[4]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[5]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[6]  Diego Calvanese,et al.  English Querying over Ontologies: E-QuOnto , 2007, AI*IA.

[7]  Allan Third,et al.  More Fragments of Language , 2006, Notre Dame J. Formal Log..

[8]  Ian Pratt-Hartmann,et al.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[9]  László Dezsö,et al.  Universal Grammar , 1981, Certainty in Action.

[10]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with Counting Quantifiers , 2005, J. Log. Lang. Inf..

[11]  Jakub Szymanik,et al.  The Computational Complexity of Quantified Reciprocals , 2009, TbiLLC.

[12]  Andrea Schaerf,et al.  On the complexity of the instance checking problem in concept languages with existential quantification , 1993, Journal of Intelligent Information Systems.

[13]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[14]  Ian Pratt-Hartmann.  Computational Complexity of Controlled Natural Languages , 2009, CNL.

[15]  Diego Calvanese,et al.  Expressing DL-Lite Ontologies with Controlled English , 2007, Description Logics.

[16]  Diego Calvanese,et al.  Efficiently Managing Data Intensive Ontologies , 2005, SWAP.

[17]  Steffen Staab,et al.  International Handbooks on Information Systems , 2013 .

[18]  Diego Calvanese,et al.  Controlled Aggregate Tree Shaped Questions over Ontologies , 2009, FQAS.

[19]  Marija Slavkovik,et al.  Deep Analysis for an Interactive Question Answering System , 2007 .