Advertisement

The Data Complexity of the Syllogistic Fragments of English

  • Camilo Thorne
  • Diego Calvanese
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6042)

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

Keywords

Data Complexity Resolution Saturation Predicate Symbol Computational Property Query Answering 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  2. 2.
    Bernardi, R., Bonin, F., Carbotta, D., Calvanese, D., Thorne, C.: English querying over ontologies: E-QuOnto. In: Proc. of the 10th Congress of the Italian Association for Artificial Intelligence AI*IA 2007 (2007)Google Scholar
  3. 3.
    Bernardi, R., Calvanese, D., Thorne, C.: Expressing DL-Lite ontologies with controlled English. In: Proc. of the 20th Int. Workshop on Description Logics, DL 2007 (2007)Google Scholar
  4. 4.
    Calvanese, D., de Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Efficiently managing data intensive ontologies. In: Proc. of the 2nd Italian Semantic Web Workshop: Semantic Web Applications and Perspectives, SWAP 2005 (2005)Google Scholar
  5. 5.
    Fermüller, C.G., Leitsch, A., Hustadt, U., Tammet, T.: Resolution decision procedures. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 2, ch. 2, 1791–1849. Elsevier - The MIT Press (2001)Google Scholar
  6. 6.
    Joyner, W.H.: Resolution strategies as decision procedures. Journal of the ACM 23(3), 398–417 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Jurafsky, D., Martin, J.: Speech and Language Processing. Prentice-Hall, Englewood Cliffs (2000)Google Scholar
  8. 8.
    Montague, R.: Universal grammar. Theoria 36(3), 373–398 (1970)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Pratt, I.: Data complexity of the two-variable fragment with counting quantifiers. Information and Computation 207(8), 867–888 (2008)CrossRefGoogle Scholar
  10. 10.
    Pratt, I., Third, A.: More fragments of language. Notre Dame Journal of Formal Logic 47(2), 151–177 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Pratt-Hartmann, I.: Computational complexity of controlled natural languages. In: Proc. of the Workshop in Controlled Languages CNL 2009 (2009)Google Scholar
  12. 12.
    Schaerf, A.: On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems 2(3), 265–278 (1993)CrossRefMathSciNetGoogle Scholar
  13. 13.
    Slavkovik, M.: Deep analysis for an interactive question answering system. Master’s thesis, Free University of Bozen-Bolzano (2007)Google Scholar
  14. 14.
    Staab, S., Studer, R. (eds.): Handbook on Ontologies. Int. Handbooks on Information Systems. Springer, Heidelberg (2004)Google Scholar
  15. 15.
    Szymanik, J.: The computational complexity of quantified reciprocals. In: Proc. of the 2007 Tbilisi Colloquium, TbiLLC 2007 (2007)Google Scholar
  16. 16.
    Thorne, C., Calvanese, D.: Tree shaped aggregate queries over ontologies. In: Proc. of the 8th Int. Conf. on Flexible Query Answering Systems FQAS 2009 (2009)Google Scholar
  17. 17.
    Vardi, M.: The complexity of relational query languages. In: Proc. of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Camilo Thorne
    • 1
  • Diego Calvanese
    • 1
  1. 1.KRDB Research CentreFree University of Bozen-BolzanoBolzanoItaly

Personalised recommendations