A translation of looping alternating automata into description logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2741, Issue , 2003, Pages 90-105

  Hladik, Jan ^a   Sattler, Ulrike ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; AUTOMATION; COMPUTER CIRCUITS; FORMAL LANGUAGES; FORMAL LOGIC; THEOREM PROVING; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; DECISION SUPPORT SYSTEMS; MODAL ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

ALTERNATING AUTOMATA; COMPLEXITY BOUNDS; DECISION PROCEDURE; DESCRIPTION LOGIC; EMPTINESS PROBLEM; SATISFIABILITY; SATISFIABILITY PROBLEMS; TARGET DESCRIPTIONS; AUTOMATA-BASED DESCRIPTION PROCEDURES; DESCRIPTION LOGICS; LOOPING ALTERNATING AUTOMATA;

DATA DESCRIPTION; AUTOMATA THEORY;

EID: 7044221797     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_8     Document Type: Conference Paper

References (28)

1. C. Areces, P. Blackburn and M. Marx. A road-map on complexity for hybrid logics. In Proc. of CSL’99, vol. 1683 of LNCS, pages 307-321. Springer-Verlag, 1999.
2. D. Berardi, D. Calvanese, and G. de Giacomo. Reasoning on UML Class Diagrams using Description Logic Based Systems. In Proc. of the KI’2001 Workshop on Applications of Description Logics. CEUR (http://ceur-ws.org/), 2001.
3. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.
4. M. Ben-Ari, J. Y. Halpern, and A. Pnueli. Deterministic propositional dynamic logic: finite models, complexity and completeness. J. of Computer and System Science, 25:402-417, 1982.
5. F. Baader and U. Sattler. An overview of tableau algorithms for description logics. Studia Logica, 69, 2001.
6. D. Calvanese, G. de Giacomo, and M. Lenzerini. Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of IJCAI-99. Morgan Kaufmann, 1999.
7. F. M. Donini and F. Massacci. Exptime tableaux for ALC. Artificial Intelligence, 124(1):87-138, 2000.
8. G. de Giacomo and M. Lenzerini. Boosting the correspondence between description logics and propositional dynamic logics (extended abstract). In Proc. of AAAI-94. AAAI Press, 1994.
9. J. Hladik. Implementation and optimisation of a tableau algorithm for the guarded fragment. Proc. of Tableaux 2002, vol. 2381 of LNAI. Springer-Verlag, 2002.
10. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logic of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
11. V. Haarslev and R. Möller. RACER system description. In Proc. of IJCAR-01, vol. 2083 of LNAI. Springer-Verlag, 2001.
12. I. Horrocks. Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, Univ. of Manchester, 1997.
13. I. Horrocks. Using an Expressive Description Logic: FaCT or Fiction? In Proc. of KR-98. Morgan Kaufmann, 1998.
14. I. Horrocks. FaCT and iFaCT. In Proc. of DL’99, 1999. CEUR (http://ceur-ws.org/).
15. Ian Horrocks and Ulrike Sattler. Optimised reasoning for SHIQ. In Proc. of ECAI 2002. IOS Press, 2002.
16. I. Horrocks, U. Sattler, and S. Tobies. Practical reasoning for expressive description logics. In Proc. of LPAR’99, vol. 1705 of LNAI. Springer-Verlag, 1999.
17. O. Kupferman and M. Y. Vardi. Freedom, weakness, and determinism: From linear-time to branching-time. In Proc. of LICS’98. IEEE Computer Society Press, 1998.
18. O. Kupferman and M. Y. Vardi. Weak alternating automata and tree automata emptiness. In Proc. of STOC 98. ACM, 1998.
19. C. Lutz and U. Sattler. The complexity of reasoning with boolean modal logics. In Advances in Modal Logics 3. CSLI Publications, 2001.
20. G. Pan, U. Sattler, and M. Y. Vardi. BDD-based decision procedures for K. In Proc. of CADE-18, vol. 2392 of LNAI. Springer-Verlag, 2002.
21. K. Schild. A correspondence theory for terminological logics: Preliminary report. In Proc. of IJCAI-91. Morgan Kaufmann, 1991.
22. Robert S. Streett and E. Allen Emerson. An automata theoretic decision procedure for the propositional μ-calculus. Information and Computation, 81:249-264, 1989.
23. E. Spaan. Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.
24. M. Schmidt-Schauß and G. Smolka. Attributive concept descriptions with complements. Artificial Intelligence, 48(1):1-26, 1991.
25. U. Sattler and M. Y. Vardi. The hybrid μ-calculus. In IJCAR-01, vol. 2083 of LNAI. Springer-Verlag, 2001.
26. W. Thomas. Automata on infinite objects. In Handbook of theoretical computer science, volume B. Elsevier Science Publishers, 1992.
27. M. Y. Vardi. Reasoning about the past with two-way automata. In Proc. of ICALP’98, vol. 1443 of LNCS, 1998. Springer-Verlag.
28. M. Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. J. of Computer and System Science, 32:183-221, 1986.