{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:24:11Z","timestamp":1742635451513},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405597"},{"type":"electronic","value":"9783540450856"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45085-6_8","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T09:13:30Z","timestamp":1288084410000},"page":"90-105","source":"Crossref","is-referenced-by-count":4,"title":["A Translation of Looping Alternating Automata into Description Logics"],"prefix":"10.1007","author":[{"given":"Jan","family":"Hladik","sequence":"first","affiliation":[]},{"given":"Ulrike","family":"Sattler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-48168-0_22","volume-title":"Computer Science Logic","author":"C. Areces","year":"1999","unstructured":"Areces, C., Blackburn, P., Marx, M.: A road-map on complexity for hybrid logics. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 307\u2013321. Springer, Heidelberg (1999)"},{"key":"8_CR2","unstructured":"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\/"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"8_CR3","unstructured":"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)"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0022-0000(82)90018-6","volume":"25","author":"M. Ben-Ari","year":"1982","unstructured":"Ben-Ari, M., Halpern, J.Y., Pnueli, A.: Deterministic propositional dynamic logic: finite models, complexity and completeness. J. of Computer and System Science\u00a025, 402\u2013417 (1982)","journal-title":"J. of Computer and System Science"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Sattler, U.: An overview of tableau algorithms for description logics. Studia Logica\u00a069 (2001)","DOI":"10.1023\/A:1013882326814"},{"key":"8_CR6","volume-title":"Proc. of IJCAI-1999","author":"D. Calvanese","year":"1999","unstructured":"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)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0004-3702(00)00070-9","volume":"124","author":"F.M. Donini","year":"2000","unstructured":"Donini, F.M., Massacci, F.: Exptime tableaux for $\\mathcal{ALC}$ . Artificial Intelligence\u00a0124(1), 87\u2013138 (2000)","journal-title":"Artificial Intelligence"},{"key":"8_CR8","volume-title":"Proc. of AAAI-1994","author":"G. Giacomo de","year":"1994","unstructured":"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)"},{"key":"8_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/3-540-45616-3_11","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"J. Hladik","year":"2002","unstructured":"Hladik, J.: Implementation and optimisation of a tableau algorithm for the guarded fragment. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, p. 145. Springer, Heidelberg (2002)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logic of knowledge and belief. Artificial Intelligence\u00a054, 319\u2013379 (1992)","journal-title":"Artificial Intelligence"},{"key":"8_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/3-540-45744-5_59","volume-title":"Automated Reasoning","author":"V. Haarslev","year":"2001","unstructured":"Haarslev, V., M\u00f6ller, R.: RACER system description. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 701. Springer, Heidelberg (2001)"},{"key":"8_CR12","unstructured":"Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, Univ. of Manchester (1997)"},{"key":"8_CR13","volume-title":"Proc. of KR-1998","author":"I. Horrocks","year":"1998","unstructured":"Horrocks, I.: Using an Expressive Description Logic: FaCT or Fiction? In: Proc. of KR-1998. Morgan Kaufmann, San Francisco (1998)"},{"key":"8_CR14","unstructured":"Horrocks, I.: FaCT and iFaCT. In: Proc. of DL 1999. CEUR (1999), http:\/\/ceur-ws.org\/"},{"key":"8_CR15","volume-title":"Proc. of ECAI 2002","author":"I. Horrocks","year":"2002","unstructured":"Horrocks, I., Sattler, U.: Optimised reasoning for $\\mathcal{SHIQ}$ . In: Proc. of ECAI 2002. IOS Press, Amsterdam (2002)"},{"key":"8_CR16","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48242-3_11","volume-title":"Logic Programming and Automated Reasoning","author":"I. Horrocks","year":"1999","unstructured":"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.\u00a01705. Springer, Heidelberg (1999)"},{"key":"8_CR17","volume-title":"Proc. of LICS 1998","author":"O. Kupferman","year":"1998","unstructured":"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)"},{"key":"8_CR18","volume-title":"Proc. of STOC 1998","author":"O. Kupferman","year":"1998","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata and tree automata emptiness. In: Proc. of STOC 1998. ACM Press, New York (1998)"},{"key":"8_CR19","volume-title":"Advances in Modal Logics 3","author":"C. Lutz","year":"2001","unstructured":"Lutz, C., Sattler, U.: The complexity of reasoning with boolean modal logics. In: Advances in Modal Logics 3. CSLI Publications, Stanford (2001)"},{"key":"8_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-45620-1_2","volume-title":"Automated Deduction - CADE-18","author":"G. Pan","year":"2002","unstructured":"Pan, G., Sattler, U., Vardi, M.Y.: BDD-based decision procedures for K. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 16. Springer, Heidelberg (2002)"},{"key":"8_CR21","volume-title":"Proc. of IJCAI-1991","author":"K. Schild","year":"1991","unstructured":"Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of IJCAI-1991. Morgan Kaufmann, San Francisco (1991)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R.S. Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional \u03bc-calculus. Information and Computation\u00a081, 249\u2013264 (1989)","journal-title":"Information and Computation"},{"key":"8_CR23","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, University of Amsterdam (1993)"},{"issue":"1","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(91)90078-X","volume":"48","author":"M. Schmidt-Schau\u00df","year":"1991","unstructured":"Schmidt-Schau\u00df, M., Smolka, G.: Attributive concept descriptions with complements. Artificial Intelligence\u00a048(1), 1\u201326 (1991)","journal-title":"Artificial Intelligence"},{"key":"8_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/3-540-45744-5_7","volume-title":"Automated Reasoning","author":"U. Sattler","year":"2001","unstructured":"Sattler, U., Vardi, M.Y.: The hybrid \u03bc-calculus. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, p. 76. Springer, Heidelberg (2001)"},{"key":"8_CR26","volume-title":"Handbook of theoretical computer science","author":"W. Thomas","year":"1992","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of theoretical computer science, vol.\u00a0B, Elsevier. Amsterdam (1992)"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming","author":"M.Y. Vardi","year":"1998","unstructured":"Vardi, M.Y.: Reasoning about the past with two-way automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, p. 628. Springer, Heidelberg (1998)"},{"key":"8_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M.Y. Vardi","year":"1986","unstructured":"Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. of Computer and System Science\u00a032, 183\u2013221 (1986)","journal-title":"J. of Computer and System Science"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-19"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45085-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T18:12:12Z","timestamp":1559758332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45085-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405597","9783540450856"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45085-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}