Fusions of description logics and abstract description systems

Journal of Artificial Intelligence Research

Volumn 16, Issue , 2002, Pages 1-58

  Baader, Franz ^a   Lutz, Carsten ^a   Sturm, Holger ^b   Wolter, Frank ^c  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF KONSTANZ   (Germany)

^c UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DECISION MAKING; LEARNING SYSTEMS;

COMPONENT LOGICS; DESCRIPTION LOGICS; MODAL LOGICS;

FORMAL LOGIC;

EID: 1942520826     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.919     Document Type: Review

References (65)

1. Areces, C., Blackburn, P., & Marx, M. (2000). The computational complexity of hybrid temporal logics. Logic Journal of the IGPL, 8(5),653-679.
2. Baader, F. (1991). Augmenting concept languages by transitive closure of roles: An alternative to terminological cycles. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91).
3. Baader, F., Bürckert, H.-J., Hollunder, B., Nutt, W., & Siekmann, J. H. (1990). Concept logics. In Lloyd, J. W. (Ed.), Computational Logics, Symposium Proceedings, pp. 177-201. Springer-Verlag.
4. Baader, F., Bürckert, H.-J., Nebel, B., Nutt, W., & Smolka, G. (1993). On the expressivity of feature logics with negation, functional uncertainty, and sort equations. J. of Logic, Language and Information, 2, 1-18.
5. Baader, F., &: Hanschke, P. (1991). A schema for integrating concrete domains into concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pp. 452-457.
6. Baader, F., & Hanschke, P. (1992). Extensions of concept languages for a mechanical engineering application. In Proc. of the 16th German Workshop on Artificial Intelligence (GWAI'92), Vol. 671 of Lecture Notes in Computer Science, pp. 132-143, Bonn (Germany). Springer-Verlag.
7. Baader, F., & Hollunder, B. (1991). A terminological knowledge representation system with complete inference algorithm. In Proc. of the Workshop on Processing Declarative Knowledge (PDK'91), Vol. 567 of Lecture Notes in Artificial Intelligence, pp. 67-86. Springer-Verlag.
8. Baader, F., & Sattler, U. (1999). Expressive number restrictions in description logics. J. of Logic and Computation, 9(3), 319-350.
9. Ben-Ari, M., Halpern, J. Y., & Pnueli, A. (1982). Deterministic propositional dynamic logic: Finite models, complexity, and completeness. J. of Computer and System Sciences, 25, 402-417.
10. Berger, R. (1966). The undecidability of the dominoe problem. Mem. Amer. Math. Soc., 66, 1-72.
11. Borgida, A. (1995). Description logics in data management. IEEE Tans. on Knowledge and Data Engineering, 7(5), 671-682.
12. Brachman, R. J., McGuinness, D. L., Patel-Schneider, P. F., Alperin Resnick, L., & Borgida, A. (1991). Living with CLASSIC: When and how to use a KL-ONE-like language. In Sowa, J. F. (Ed.), Principles of Semantic Networks, pp. 401-456. Morgan Kaufmann, Los Altos.
13. Brachman, R. J., & Schmolze, J. G. (1985). An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2), 171-216.
14. Bresciani, P., Franconi, E., & Tessaris, S. (1995). Implementing and testing expressive description logics: Preliminary report. In Proc. of the 1995 Description Logic Workshop (DL'95), pp. 131-139.
15. Calvanese, D., De Giacomo, G., & Lenzerini, M. (1999). Reasoning in expressive description logics with fixpoints based on automata on infinite trees. In Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), pp. 84-89.
16. Calvanese, D., De Giacomo, G., & Rosati, R. (1998). A note on encoding inverse roles and functional restrictions in ALC knowledge bases. In Proc. of the 1998 Description Logic Workshop (DL'98), pp. 69-71. CEUR Electronic Workshop Proceedings, http://ceurws.org/Vol-11/.
17. Chellas, B. F. (1980). Modal logic. Cambridge University Press, Cambridge, UK.
18. Danecki, R. (1984). Nondeterministic Prepositional Dynamic Logic with intersection is decidable. In Proc. of the 5th Symp. on Computation Theory, Vol. 208 of Lecture Notes in Computer Science, pp. 34-53. Springer-Verlag.
19. De Giacomo, G. (1995). Decidability of Class-Based Knowledge Representation Formalisms. Ph.D. thesis, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza".
20. De Giacomo, G., & Lenzerini, M. (1994a). Boosting the correspondence between description logics and propositional dynamic logics. In Proc. of the 12th Nat. Conf. on Artificial Intelligence (AAAI'94), pp. 205-212. AAAI Press/The MIT Press.
21. De Giacomo, G., & Lenzerini, M. (1994b). Concept language with number restrictions and fixpoints, and its relationship with μ-calculus. In Proc. of the 11th Eur. Conf. on Artificial Intelligence (ECAI'94), pp. 411-415.
22. De Giacomo, G., &: Lenzerini, M. (1995). What's in an aggregate: Foundations for description logics with tuples and sets. In Proc. of the 14th Int. Joint Conf. on Artificial Intelligence (IJCAI'95), pp. 801-807.
23. Donini, F. M., Hollunder, B., Lenzerini, M., Spaccamela, A. M., Nardi, D., &: Nutt, W. (1992). The complexity of existential quantification in concept languages. Artificial Intelligence, 2-3, 309-327.
24. Donini, F. M., Lenzerini, M., Nardi, D., & Nutt, W. (1991). Tractable concept languages. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pp. 458-463, Sydney (Australia).
25. Donini, F. M., Lenzerini, M., Nardi, D., & Nutt, W. (1997). The complexity of concept languages. Information and Computation, 134, 1-58.
26. Donini, F. M., Lenzerini, M., Nardi, D., & Schaerf, A. (1994). Deduction in concept languages: From subsumption to instance checking. J. of Logic and Computation, 4(4), 423-452.
27. Došen, K. (1988). Duality between modal algebras and neighbourhood frames. Studia Logica, 48, 219-234.
28. Fine, K., & Schurz, G. (1996). Transfer theorems for stratified modal logics. In Copeland, J. (Ed.), Logic and Reality: Essays in Pure and Applied Logic. In Memory of Arthur Prior, pp. 169-213. Oxford University Press.
29. Fischer, M. J., &: Ladner, R. E. (1979). Propositional dynamic logic of regular programs. J. of Computer and System Sciences, 18, 194-211.
30. Gabbay, D. M. (1999). Fibring Logics, Vol. 38 of Oxford Logic Guides. Clarendon Press, Oxford.
31. Gargov, G., & Goranko, V. (1993). Modal logic with names. J. of Philosophical Logic, 22, 607-636.
32. Goldblatt, R. I. (1989). Varieties of complex algebras. Annals of Pure and Applied Logic, 38, 173-241.
33. Goranko, V., & Passy, S. (1992). Using the universal modality: Gains and questions. Journal of Logic and Computation, 2(1), 5-30.
34. Gr̈atzer, G. (1979). Universal Algebra. Springer-Verlag, New York.
35. R+ extended with concrete domains: A practically motivated approach. In Proceedings of the International Joint Conference on Automated Reasoning IJCAR'01, Lecture Notes in Artificial Intelligence. Springer-Verlag.
36. Harel, D. (1984). Dynamic logic. In Handbook of Philosophical Logic, Vol. 2, pp. 497-640. D. Reidel, Dordrecht (Holland).
37. Hollunder, B., & Baader, F. (1991). Qualifying number restrictions in concept languages. Tech. rep. RR-91-03, Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI), Kaiserslautern (Germany). An abridged version appeared in Proc. of the 2nd Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'91).
38. Hollunder, B., & Nutt, W. (1990). Subsumption algorithms for concept languages. Tech. rep. RR-90-04, Deutsches Forschungszentrum für Künstliche Intelligenz (DFKI), Kaiserslautern (Germany).
39. Horrocks, I. (1998). Using an expressive description logic: FaCT or fiction?. In Proc. of the 6th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR '98), pp. 636-647.
40. Horrocks, I., & Sattler, U. (1999). A description logic with transitive and inverse roles and role hierarchies. J. of Logic and Computation, 9(3), 385-410.
41. Horrocks, I., Sattler, U., & Tobies, S. (2000). Practical reasoning for very expressive description logics. J. of the Interest Group in Pure and Applied Logic, 8(3), 239-264.
42. Jónsson, B., & Tarski, A. (1951). Boolean algebras with operators. I. American Journal of Mathematics, 73, 891-939.
43. Jónsson, B., & Tarski, A. (1952). Boolean algebras with operators. II. American Journal of Mathematics, 74, 127-162.
44. Knuth, D. E. (1973). The Art of Computer Programming, Vol. 3. Addison-Wesley, Mass.
45. Kracht, M., & Wolter, F. (1991). Properties of independently axiomatizable bimodal logics. The Journal of Symbolic Logic, 56(4), 1469-1485.
46. Kutz, O., Wolter, F., & Zakharyaschev, M. (2001). Connecting abstract description systems. Submitted. Available from http://www.informatik.uni- leipzig.de/~wolter/.
47. Levesque, H. J., & Brachman, R. J. (1987). Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3, 78-93.
48. Lutz, C. (1999). Reasoning with concrete domains. In Dean, T. (Ed.), Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI'99), pp. 90-95, Stockholm, Sweden. Morgan Kaufmann, Los Altos.
49. Lutz, C. (2001). Interval-based temporal reasoning with general TBoxes. In Proc. of the 17th Int. Joint Conf. on Artificial Intelligence (IJCAI 2001), pp. 89-94.
50. Lutz, C., & Sattler, U. (2000). Mary likes all cats. In Proc. of the 2000 Description Logic Workshop (DL 2000), pp. 213-226. CEUR Electronic Workshop Proceedings, http://ceur-ws.org/Vol-33/.
51. Nebel, B. (1988). Computational complexity of terminological reasoning in BACK. Artificial Intelligence, 34(3), 371-383.
52. Nebel, B. (1990). Terminological reasoning is inherently intractable. Artificial Intelligence, 43, 235-249.
53. Parikh, R. (1980). Propositional logics of programs: Systems, models and complexity. In Proc. of the 7th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages (POPL'80), pp. 186-192, Las Vegas (USA).
54. Prior, A. N. (1967). Past, Present and Future. Oxford University Press.
55. Sattler, U. (1996). A concept language extended with different kinds of transitive roles. In Görz, G., & Hölldobler, S. (Eds.), Proc. of the 20th German Annual Conf. on Artificial Intelligence (KI'96), No. 1137 in Lecture Notes in Artificial Intelligence, pp. 333-345. Springer-Verlag.
56. Schaerf, A. (1993). On the complexity of the instance checking problem in concept languages with existential quantification. J. of Intelligent Information Systems, 2, 265-278.
57. Schaerf, A. (1994). Reasoning with individuals in concept languages. Data and Knowledge Engineering, 13(2), 141-176.
58. Schild, K. (1991). A correspondence theory for terminological logics: Preliminary report. In Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91), pp. 466-471.
59. Schmidt-Schauß, M. (1989). Subsumption in KL-ONE is undecidable. In Brachman, R. J., Levesque, H. J., & Reiter, R. (Eds.), Proc. of the 1st Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR'89), pp. 421-431. Morgan Kaufmann, Los Altos.
60. Schmidt-Schauß, M., & Smolka, G. (1991). Attributive concept descriptions with complements. Artificial Intelligence, 48(1), 1-26.
61. Spaan, E. (1993). Complexity of Modal Logics. Ph.D. thesis, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands.
62. Van der Hoek, W., &: de Rijke, M. (1995). Counting objects. J. of Logic and Computation, 5(3), 325-345.
63. Wolter, F. (1998). Fusions of modal logics revisited. In Kracht, M., de Rijke, M., Wansing, H., & Zakharyaschev, M. (Eds.), Advances in Modal Logic, pp. 361-379. CSLI Publications.
64. Woods, W. A., & Schmolze, J. G. (1992). The KL-ONE family. In Lehmann, F. W. (Ed.), Semantic Networks in Artificial Intelligence, pp. 133-178. Pergamon Press.
65. Published as a special issue of Computers & Mathematics with Applications, Volume 23, Number 2-9.