Abstract
We present a translation of (one-way and two-way) alternating automata into description logics, thus reducing the emptiness problem for alternating automata to satisfiability of the target description logic. The latter problem can then be decided using highly optimised, tableau-based description logic reasoners. The translation is a step towards the understanding of the relationship between automata- and tableau-based decision procedures for description and modal logics. Moreover, it yields some by-products: (i) a program deciding the emptiness problem for alternating automata and thus the satisfiability problem for logics with automata-based decision procedures; and (ii) tight complexity bounds for the target description logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 307–321. Springer, Heidelberg (1999)
Berardi, D., Calvanese, D., de Giacomo, G.: Reasoning on UML Class Diagrams using Description Logic Based Systems. In: Proc. of the KI 2001 Workshop on Applications of Description Logics. CEUR (2001), http://ceur-ws.org/
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)
Ben-Ari, M., Halpern, J.Y., Pnueli, A.: Deterministic propositional dynamic logic: finite models, complexity and completeness. J. of Computer and System Science 25, 402–417 (1982)
Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica 69 (2001)
Calvanese, D., de Giacomo, G., Lenzerini, M.: Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In: Proc. of IJCAI-1999. Morgan Kaufmann, San Francisco (1999)
Donini, F.M., Massacci, F.: Exptime tableaux for \(\mathcal{ALC}\). Artificial Intelligence 124(1), 87–138 (2000)
de Giacomo, G., Lenzerini, M.: Boosting the correspondence between description logics and propositional dynamic logics (extended abstract). In: Proc. of AAAI-1994. AAAI Press, Menlo Park (1994)
Hladik, J.: Implementation and optimisation of a tableau algorithm for the guarded fragment. In: Egly, U., Fermüller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, p. 145. Springer, Heidelberg (2002)
Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logic of knowledge and belief. Artificial Intelligence 54, 319–379 (1992)
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)
Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, Univ. of Manchester (1997)
Horrocks, I.: Using an Expressive Description Logic: FaCT or Fiction? In: Proc. of KR-1998. Morgan Kaufmann, San Francisco (1998)
Horrocks, I.: FaCT and iFaCT. In: Proc. of DL 1999. CEUR (1999), http://ceur-ws.org/
Horrocks, I., Sattler, U.: Optimised reasoning for \(\mathcal{SHIQ}\). In: Proc. of ECAI 2002. IOS Press, Amsterdam (2002)
Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds.) LPAR 1999. LNCS (LNAI), vol. 1705. Springer, Heidelberg (1999)
Kupferman, O., Vardi, M.Y.: Freedom, weakness, and determinism: From linear-time to branching-time. In: Proc. of LICS 1998. IEEE Computer Society Press, Los Alamitos (1998)
Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proc. of STOC 1998. ACM Press, New York (1998)
Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: Advances in Modal Logics 3. CSLI Publications, Stanford (2001)
Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for K. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, p. 16. Springer, Heidelberg (2002)
Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of IJCAI-1991. Morgan Kaufmann, San Francisco (1991)
Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional μ-calculus. Information and Computation 81, 249–264 (1989)
Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam (1993)
Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence 48(1), 1–26 (1991)
Sattler, U., Vardi, M.Y.: The hybrid μ-calculus. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, p. 76. Springer, Heidelberg (2001)
Thomas, W.: Automata on infinite objects. In: Handbook of theoretical computer science, vol. B, Elsevier. Amsterdam (1992)
Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, p. 628. Springer, Heidelberg (1998)
Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. of Computer and System Science 32, 183–221 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hladik, J., Sattler, U. (2003). A Translation of Looping Alternating Automata into Description Logics. In: Baader, F. (eds) Automated Deduction – CADE-19. CADE 2003. Lecture Notes in Computer Science(), vol 2741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45085-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-45085-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40559-7
Online ISBN: 978-3-540-45085-6
eBook Packages: Springer Book Archive