메뉴 건너뛰기




Volumn 53, Issue 1-4, 2008, Pages 115-152

Exploiting conjunctive queries in description logic programs

Author keywords

Answer set programming; Conjunctive queries and description logics; Hybrid rule languages; Semantic web

Indexed keywords


EID: 67349275638     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9111-3     Document Type: Article
Times cited : (12)

References (40)
  • 1
    • 33746064915 scopus 로고    scopus 로고
    • Combining rules and ontologies: A survey
    • IST506779/Linköping/I3-D3/D/PU/a1, Linköping University, Feb.
    • Antoniou, G., Damásio, C.V., Grosof, B., Horrocks, I., Kifer, M., Maluszynski, J., Patel-Schneider, P.F.: Combining rules and ontologies: a survey. Tech. Rep. IST506779/Linköping/I3-D3/D/PU/a1, Linköping University, Feb. (2005)
    • (2005) Tech. Rep.
    • Antoniou, G.1
  • 3
    • 36349023790 scopus 로고    scopus 로고
    • Answering regular path queries in expressive description logics: An automata-theoretic approach
    • AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference
    • Calvanese, D., Eiter, T., Ortiz, M.: Answering regular path queries in expressive description logics: an automata-theoretic approach. In: AAAI, pp. 391-396. AAAI, Menlo Park (2007) (Pubitemid 350149602)
    • (2007) Proceedings of the National Conference on Artificial Intelligence , vol.1 , pp. 391-396
    • Calvanese, D.1    Eiter, T.2    Ortiz, M.3
  • 4
    • 0038062314 scopus 로고    scopus 로고
    • Complexity and expressive power of logic programming
    • E. Dantsin T. Eiter G. Gottlob A. Voronkov 2001 Complexity and expressive power of logic programming ACM Comput. Surv. 33 3 374 425 (Pubitemid 33768487)
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 374-425
    • Dantsin, E.1    Eiter, T.2    Gottlob, G.3    Voronkov, A.4
  • 7
    • 46549089044 scopus 로고    scopus 로고
    • Combining answer set programming with description logics for the semantic web
    • 1495-1539
    • Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artif. Intell. 172(12-13), 1495-1539 (2008)
    • (2008) Artif. Intell. , vol.172 , pp. 12-13
    • Eiter, T.1    Ianni, G.2    Lukasiewicz, T.3    Schindlauer, R.4    Tompits, H.5
  • 9
    • 84880721144 scopus 로고    scopus 로고
    • A uniform integration of higher-order reasoning and external evaluations in answer-set programming
    • Professional Book Center Denver
    • Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: A uniform integration of higher-order reasoning and external evaluations in answer-set programming. In: Proceedings IJCAI-2005, pp. 90-96. Professional Book Center, Denver (2005)
    • (2005) Proceedings IJCAI-2005 , pp. 90-96
    • Eiter, T.1    Ianni, G.2    Schindlauer, R.3    Tompits, H.4
  • 11
    • 77249173466 scopus 로고    scopus 로고
    • Well-founded semantics for description logic programs in the semantic web
    • Springer New York
    • Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Well-founded semantics for description logic programs in the semantic web. In: Proceedings RuleML-2004. LNCS, vol. 3323, pp. 81-97. Springer, New York (2004)
    • (2004) Proceedings RuleML-2004 LNCS 3323 , pp. 81-97
    • Eiter, T.1    Lukasiewicz, T.2    Schindlauer, R.3    Tompits, H.4
  • 12
    • 22944450067 scopus 로고    scopus 로고
    • Recursive aggregates in disjunctive logic programs: Semantics and complexity
    • Springer New York
    • Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Proceedings JELIA-2004. LNCS/LNAI, vol. 3229, pp. 200-212. Springer, New York (2004)
    • (2004) Proceedings JELIA-2004 LNCS/LNAI 3229 , pp. 200-212
    • Faber, W.1    Leone, N.2    Pfeifer, G.3
  • 15
    • 84867759223 scopus 로고    scopus 로고
    • RACER System Description
    • Automated Reasoning
    • Haarslev, V., Möller, R.: RACER system description. In: Proceedings IJCAR-2001. LNCS/LNAI, vol. 2083, pp. 701-705. Springer, New York (2001) (Pubitemid 33291468)
    • (2001) LECTURE NOTES in COMPUTER SCIENCE , Issue.2083 , pp. 701-706
    • Haarslev, V.1    Moller, R.2
  • 16
    • 9344221124 scopus 로고    scopus 로고
    • Reducing OWL entailment to description logic satisfiability
    • I. Horrocks P.F. Patel-Schneider 2004 Reducing OWL entailment to description logic satisfiability J. Web Semantics 1 4 345 357
    • (2004) J. Web Semantics , vol.1 , Issue.4 , pp. 345-357
    • Horrocks, I.1    Patel-Schneider, P.F.2
  • 17
    • 84886280180 scopus 로고    scopus 로고
    • Practical reasoning for expressive description logics
    • Springer New York
    • Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for expressive description logics. In: Proceedings LPAR-1999. LNCS/LNAI, vol. 1705, pp. 161-180. Springer, New York (1999)
    • (1999) Proceedings LPAR-1999 LNCS/LNAI 1705 , pp. 161-180
    • Horrocks, I.1    Sattler, U.2    Tobies, S.3
  • 19
    • 67349213503 scopus 로고    scopus 로고
    • Integration of conjunctive queries over description logics into HEX-programs
    • Master's thesis, Vienna University of Technology A-1040 Wien, October
    • Krennwallner, T.: Integration of conjunctive queries over description logics into HEX-programs. Master's thesis, Vienna University of Technology, Karlsplatz 13, A-1040 Wien, October (2007)
    • (2007) Karlsplatz , vol.13
    • Krennwallner, T.1
  • 21
    • 84872946518 scopus 로고    scopus 로고
    • Inverse roles make conjunctive queries hard
    • Bressanone, 2007, number 250 in CEUR Workshop Proceedings
    • Lutz, C.: Inverse roles make conjunctive queries hard. In: Proceedings of the 2007 International Workshop on Description Logics (DL2007), Bressanone, 2007, number 250 in CEUR Workshop Proceedings, http://ceur-ws.org/, pp. 100-111 (2007)
    • (2007) Proceedings of the 2007 International Workshop on Description Logics (DL2007) , pp. 100-111
    • Lutz, C.1
  • 22
    • 9444254656 scopus 로고    scopus 로고
    • Logic programs with monotone cardinality atoms.
    • Marek, V., Niemelä, I., Truszczyśki, M.: Logic programs with monotone cardinality atoms. In: Proceedings LPNMR-2004, LNCS, vol. 2923, pp. 154-166 (2004)
    • (2004) Proceedings LPNMR-2004, LNCS , vol.2923 , pp. 154-166
    • Marek, V.1
  • 23
    • 67349203798 scopus 로고    scopus 로고
    • On the Expressibility of Stable Logic Programming
    • Logic Programming and Nonmonotonic Reasoning
    • W. Marek J. Remmel 2003 On the expressibility of stable logic programming Theory Pract. Log. Program. 3 4-5 551 567 (Pubitemid 33347400)
    • (2001) LECTURE NOTES in COMPUTER SCIENCE , Issue.2173 , pp. 107-120
    • Marek, V.W.1    Remmel, J.R.2
  • 24
    • 0000313114 scopus 로고
    • Autoepistemic Logic
    • W. Marek M. Truszczyński 1991 Autoepistemic Logic J. ACM 38 3 588 619
    • (1991) J. ACM , vol.38 , Issue.3 , pp. 588-619
    • Marek, W.1    Truszczyński, M.2
  • 25
    • 33845431597 scopus 로고    scopus 로고
    • Can OWL and logic programming live together happily ever after?
    • Springer New York
    • Motik, B., Horrocks, I., Rosati, R., Sattler, U.: Can OWL and logic programming live together happily ever after? In: Proceedings ISWC-2006, LNCS, vol. 4273, pp. 501-514. Springer, New York (2006)
    • (2006) Proceedings ISWC-2006 LNCS 4273 , pp. 501-514
    • Motik, B.1    Horrocks, I.2    Rosati, R.3    Sattler, U.4
  • 30
    • 84872960830 scopus 로고    scopus 로고
    • Data complexity of answering unions of conjunctive queries in SHIQ
    • Parsi, B., Sattler, U., Toman, D. (eds.) The Lake District of the UK, May 30 - June 1, 2006, CEUR Workshop Proceedings
    • Ortiz de la Fuente, M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. In: Parsi, B., Sattler, U., Toman, D. (eds.) Proceedings of the 2006 International Workshop on Description Logics (DL2006), The Lake District of the UK, May 30 - June 1, 2006, CEUR Workshop Proceedings, vol. 189, pp. 62-73. http://CEUR-WS.org/Vol-189 (2006).
    • (2006) Proceedings of the 2006 International Workshop on Description Logics (DL2006) , vol.189 , pp. 62-73
    • Ortiz De La Fuente, M.1    Calvanese, D.2    Eiter, T.3
  • 31
    • 33750700796 scopus 로고    scopus 로고
    • Characterizing data complexity for conjunctive query answering in expressive description logics
    • AAAI Menlo Park
    • Ortiz de la Fuente, M., Calvanese, D., Eiter, T., Franconi, E.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proceedings AAAI-2006. AAAI, Menlo Park (2006)
    • (2006) Proceedings AAAI-2006
    • Ortiz De La Fuente, M.1    Calvanese, D.2    Eiter, T.3    Franconi, E.4
  • 32
    • 67349173118 scopus 로고    scopus 로고
    • Data complexity of query answering in expressive description logics via tableaux
    • Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria, November (Accepted for publication in J. Autom. Reason.)
    • Ortiz de la Fuente, M., Calvanese, D., Eiter, T.: Data complexity of query answering in expressive description logics via tableaux. Technical Report INFSYS RR-1843-07-07, Institut für Informationssysteme, Technische Universität Wien, A-1040 Vienna, Austria, November (2007) (Accepted for publication in J. Autom. Reason.)
    • (2007) Technical Report INFSYS RR-1843-07-07
    • Ortiz De La Fuente, M.1    Calvanese, D.2    Eiter, T.3
  • 36
    • 84878705786 scopus 로고    scopus 로고
    • The limits of querying ontologies
    • Springer New York
    • Rosati, R.: The limits of querying ontologies. In: Proc. ICDT 2007. LNCS, vol. 4353, pp. 164-178. Springer, New York (2007)
    • (2007) Proc. ICDT 2007 LNCS 4353 , pp. 164-178
    • Rosati, R.1
  • 37
    • 0031237480 scopus 로고    scopus 로고
    • Partial deduction in disjunctive logic programming
    • PII S0743106696001203
    • C. Sakama H. Seki 1997 Partial deduction in disjunctive logic programming J. Log. Program. 32 3 229 245 (Pubitemid 127382249)
    • (1997) Journal of Logic Programming , vol.32 , Issue.3 , pp. 229-245
    • Sakama, C.1    Seki, H.2
  • 38
    • 67349200182 scopus 로고    scopus 로고
    • Ph.D. thesis, Vienna University of Technology, Austria, December 2006. VDM Verlag Dr. Mueller
    • Schindlauer, R.: Answer-Set Programming for the Semantic Web. Ph.D. thesis, Vienna University of Technology, Austria, December 2006. VDM Verlag Dr. Mueller (2008)
    • (2008) Answer-Set Programming for the Semantic Web
    • Schindlauer, R.1
  • 39
    • 6344271958 scopus 로고    scopus 로고
    • OWL web ontology language guide
    • (2004). (The Wine ontology is available from there, or directly at, W3C, February
    • Smith, M., Welty, C., McGuinness, D.: OWL web ontology language guide. W3C Recommendation, W3C, February. http://www.w3.org/TR/owl-guide/ (2004). (The Wine ontology is available from there, or directly at http://www.w3.org/TR/owl- guide/wine.rdf )
    • W3C Recommendation
    • Smith, M.1    Welty, C.2    McGuinness, D.3
  • 40
    • 67349226295 scopus 로고    scopus 로고
    • W3C: OWL 1.1 Web ontology language overview
    • W3C: OWL 1.1 Web ontology language overview. http://www.w3.org/ Submission/owl11-overview/ (2006)


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