Abstract
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constructor, which generalizes both the usual existential restrictions and so-called qualified number restrictions. We show that the new constructor can be expressed in \(\mathcal{ALCQ}\), the extension of the basic DL \(\mathcal{ALC}\) by qualified number restrictions. However, this representation results in an exponential blow-up. By giving direct algorithms for \(\mathcal{ALC}\) extended with the new constructor, we can show that the complexity of reasoning in this new DL is actually not harder than the one of reasoning in \(\mathcal{ALCQ}\). Moreover, in our chemical process engineering application, a restricted DL that provides only the new constructor together with conjunction, and satisfies an additional restriction on the occurrence of roles names, is sufficient. For this DL, the subsumption problem is polynomial.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\)-envelope. In: Proc. 19th Int. Joint Conf. on Artificial Intelligence (2005) (to appear)
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)
Baader, F., Hanschke, P.: Extensions of concept languages for a mechanical engineering application. In: Ohlbach, H.J. (ed.) GWAI 1992. LNCS, vol. 671. Springer, Heidelberg (1993)
Baader, F., Küsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proc. 16th Int. Joint Conf. on Artificial Intelligence (1999)
Baader, F., Lutz, C., Karabaev, E., Theißen, M.: A new n-ary existential quantifier in description logics. LTCS-Report 05-08, Theoretical Computer Science, TU Dresden, Germany (2005), See http://lat.inf.tu-dresden.de/research/reports.html
Baader, F., Milicic, M., Lutz, C., Sattler, U., Wolter, F.: Integrating description logics and action formalisms for reasoning about web services. LTCS-Report 05-02, Theoretical Computer Science, TU Dresden, Germany (2005), See http://lat.inf.tu-dresden.de/research/reports.html
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)
Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and—what else? In: Proc. 16th Eur. Conf. on Artificial Intelligence (2004)
Calvanese, D., Lenzerini, M., Nardi, D.: A unified framework for class based representation formalisms. In: Proc. 4th Int. Conf. on the Principles of Knowledge Representation and Reasoning (1994)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)
Donini, F.: Complexity of reasoning. In: [2] (2003)
Garey, M.R., Johnson, D.S.: Computers and Intractability — A guide to NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Haarslev, V., Möller, R.: RACER system description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, p. 701. Springer, Heidelberg (2001)
Hall, P.: On representatives of subsets. The Journal of the London Mathematical Society 10, 26–30 (1935)
Horrocks, I.: Using an expressive description logic: FaCT or fiction? In: Proc. 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (1998)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. J. of the Interest Group in Pure and Applied Logic 8(3), 239–264 (2000)
Kolaitis, P.G., Martin, D.M., Thakur, M.N.: On the complexity of the containment problem for conjunctive queries with built-in predicates. In: Proc. 17th ACM Symp. on Principles of Database Systems (1998)
Lutz, C.: Complexity of terminological reasoning revisited. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705. Springer, Heidelberg (1999)
Nebel, B.: Terminological reasoning is inherently intractable. Artificial Intelligence 43, 235–249 (1990)
Qian, X.: Query folding. In: Proc. 12th IEEE Int. Conf. on Data Engineering (1996)
Reyner, S.W.: An analysis of a good algorithm for the subtree problem. SIAM J. on Computing 6(4), 730–732 (1977)
Sattler, U.: A concept language extended with different kinds of transitive roles. In: Görz, G., Hölldobler, S. (eds.) KI 1996. LNCS (LNAI), vol. 1137. Springer, Heidelberg (1996)
Theißen, M., von Wedel, L.: The need for an n-ary existential quantifier in description logics. In: Proc. KI- 2004 Workshop on Applications of Description Logics. CEUR Electronic Workshop Proceedings (2004), http://CEUR-WS.org/Vol-115/
Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, Computer Science Department, RWTH Aachen, Germany (2001)
Yannakakis, M.: Algorithms for acyclic database schemes. In: Proc. 7th Int. Conf. on Very Large Data Bases (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baader, F., Karabaev, E., Lutz, C., Theißen, M. (2005). A New n-Ary Existential Quantifier in Description Logics. In: Furbach, U. (eds) KI 2005: Advances in Artificial Intelligence. KI 2005. Lecture Notes in Computer Science(), vol 3698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551263_4
Download citation
DOI: https://doi.org/10.1007/11551263_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28761-2
Online ISBN: 978-3-540-31818-7
eBook Packages: Computer ScienceComputer Science (R0)