메뉴 건너뛰기




Volumn 31, Issue , 2008, Pages 157-204

Conjunctive query answering for the description logic SHIQ

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; KNOWLEDGE BASED SYSTEMS; QUERY LANGUAGES;

EID: 44449142497     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2372     Document Type: Article
Times cited : (144)

References (36)
  • 1
    • 0003727420 scopus 로고    scopus 로고
    • Baader, F, Calvanese, D, McGuinness, D. L, Nardi, D, & Patel-Schneider, P. F, Eds, Cambridge University Press
    • Baader, F., Calvanese, D., McGuinness, D. L., Nardi, D., & Patel-Schneider, P. F. (Eds.). (2003). The Description Logic Handbook. Cambridge University Press.
    • (2003) The Description Logic Handbook
  • 4
    • 34548305118 scopus 로고    scopus 로고
    • Tractable reasoning and efficient query answering in description logics: The dl-lite family
    • Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., & Rosati, R. (2007). Tractable reasoning and efficient query answering in description logics: The dl-lite family. Journal of Automated Reasoning, 39(3), 385-429.
    • (2007) Journal of Automated Reasoning , vol.39 , Issue.3 , pp. 385-429
    • Calvanese, D.1    De Giacomo, G.2    Lembo, D.3    Lenzerini, M.4    Rosati, R.5
  • 10
    • 10844290086 scopus 로고    scopus 로고
    • Why are modal logics so robustly decidable?
    • Paun, G, Rozenberg, G, & Salomaa, A, Eds, World Scientific
    • Grädel, E. (2001). Why are modal logics so robustly decidable?. In Paun, G., Rozenberg, G., & Salomaa, A. (Eds.), Current Trends in Theoretical Computer Science, Entering the 21th Century, Vol. 2, pp. 393-408. World Scientific.
    • (2001) Current Trends in Theoretical Computer Science, Entering the 21th Century , vol.2 , pp. 393-408
    • Grädel, E.1
  • 13
    • 44449087395 scopus 로고    scopus 로고
    • Horrocks, I., Sattler, U., Tessaris, S., & Tobies, S. (1999). Query containment using a DLR ABox. Ltcs-report LTCS-99-15, LuFG Theoretical Computer Science, RWTH Aachen, Germany. Available online at http://www-lti.informatik. rwth-aachen.de/Forschung/Reports.html.
    • Horrocks, I., Sattler, U., Tessaris, S., & Tobies, S. (1999). Query containment using a DLR ABox. Ltcs-report LTCS-99-15, LuFG Theoretical Computer Science, RWTH Aachen, Germany. Available online at http://www-lti.informatik. rwth-aachen.de/Forschung/Reports.html.
  • 14
    • 84937405545 scopus 로고    scopus 로고
    • Reasoning with Individuals for the Description Logic SHIQ
    • McAllester, D, Ed, Proceedings of the 17th International Conference on Automated Deduction CADE 2000, No, in, Springer-Verlag
    • Horrocks, I., Sattler, U., & Tobies, S. (2000). Reasoning with Individuals for the Description Logic SHIQ. In McAllester, D. (Ed.), Proceedings of the 17th International Conference on Automated Deduction (CADE 2000), No. 1831 in Lecture Notes in Artificial Intelligence, pp. 482-496. Springer-Verlag.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1831 , pp. 482-496
    • Horrocks, I.1    Sattler, U.2    Tobies, S.3
  • 17
    • 0032156942 scopus 로고    scopus 로고
    • Combining horn rules and description logics in CARIN
    • Levy, A. Y., & Rousset, M.-C. (1998). Combining horn rules and description logics in CARIN. Artificial Intelligence, 104(1-2), 165-209.
    • (1998) Artificial Intelligence , vol.104 , Issue.1-2 , pp. 165-209
    • Levy, A.Y.1    Rousset, M.-C.2
  • 19
    • 0032119616 scopus 로고    scopus 로고
    • An industrial strength description logic-based configuration platform
    • McGuinness, D. L., & Wright, J. R. (1998). An industrial strength description logic-based configuration platform. IEEE Intelligent Systems, 13(4).
    • (1998) IEEE Intelligent Systems , vol.13 , Issue.4
    • McGuinness, D.L.1    Wright, J.R.2
  • 24
    • 34250652540 scopus 로고    scopus 로고
    • On the ddecidability and finite controllability of query processing in databases with incomplete information
    • ACM Press and Addison Wesley
    • Rosati, R. (2006b). On the ddecidability and finite controllability of query processing in databases with incomplete information. In Proceedings of the 25th ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS-06), pp. 356-365. ACM Press and Addison Wesley.
    • (2006) Proceedings of the 25th ACM SIGACT SIGMOD Symposium on Principles of Database Systems (PODS-06) , pp. 356-365
    • Rosati, R.1
  • 25
    • 84878705786 scopus 로고    scopus 로고
    • The limits of querying ontologies
    • Proceedings of the Eleventh International Conference on Database Theory ICDT 2007, of, Springer-Verlag
    • Rosati, R. (2007a). The limits of querying ontologies. In Proceedings of the Eleventh International Conference on Database Theory (ICDT 2007), Vol. 4353 of Lecture Notes in Computer Science, pp. 164-178. Springer-Verlag.
    • (2007) Lecture Notes in Computer Science , vol.4353 , pp. 164-178
    • Rosati, R.1
  • 26
    • 78751679356 scopus 로고    scopus 로고
    • Rosati, R. (2007b). On conjunctive query answering in EL. In Proceedings of the 2007 Description Logic Workshop (DL 2007). CEUR Workshop Proceedings.
    • Rosati, R. (2007b). On conjunctive query answering in EL. In Proceedings of the 2007 Description Logic Workshop (DL 2007). CEUR Workshop Proceedings.
  • 27
    • 0001246967 scopus 로고
    • On the complexity of the instance checking problem in concept languages with existential quantification
    • Schaerf, A. (1993). On the complexity of the instance checking problem in concept languages with existential quantification. Journal of Intelligent Information Systems, 2(3), 265-278.
    • (1993) Journal of Intelligent Information Systems , vol.2 , Issue.3 , pp. 265-278
    • Schaerf, A.1
  • 32
    • 33749556448 scopus 로고    scopus 로고
    • FaCT++ description logic reasoner: System description
    • Furbach, U, & Shankar, N, Eds, Proceedings of the Third International Joint Conference on Automated Reasoning IJCAR 2006, of, Springer-Verlag
    • Tsarkov, D., & Horrocks, I. (2006). FaCT++ description logic reasoner: System description. In Furbach, U., & Shankar, N. (Eds.), Proceedings of the Third International Joint Conference on Automated Reasoning (IJCAR 2006), Vol. 4130 of Lecture Notes in Computer Science, pp. 292-297. Springer-Verlag.
    • (2006) Lecture Notes in Computer Science , vol.4130 , pp. 292-297
    • Tsarkov, D.1    Horrocks, I.2
  • 33
    • 0003221260 scopus 로고    scopus 로고
    • Logical approaches to incomplete information: A survey
    • Kluwer Academic Publishers
    • van der Meyden, R. (1998). Logical approaches to incomplete information: A survey. In Logics for Databases and Information Systems, pp. 307-356. Kluwer Academic Publishers.
    • (1998) Logics for Databases and Information Systems , pp. 307-356
    • van der Meyden, R.1
  • 34
    • 44449179810 scopus 로고    scopus 로고
    • Vardi, M. Y. (1997). Why is modal logic so robustly decidable?. In Descriptive Complexity and Finite Models: Proceedings of a DIMACS Workshop, 31 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pp. 149-184. American Mathematical Society.
    • Vardi, M. Y. (1997). Why is modal logic so robustly decidable?. In Descriptive Complexity and Finite Models: Proceedings of a DIMACS Workshop, Vol. 31 of DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, pp. 149-184. American Mathematical Society.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.