LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Konev, B.; Kontchakov, Roman; Michel, L.; Schneider, T.; Wolter, F.; Zakharyaschev, Michael (2011)
Publisher: AAAI Press
Languages: English
Types: Part of book or chapter of book
Subjects: csis
The OWL2 profile OWL 2 QL, based on the DL-Lite family of description logics, is emerging as a major language for developing new ontologies and approximating the existing ones. Its main application is ontology based data access, where ontologies are used to provide background knowledge for answering queries over data. We investigate the corresponding notion of query inseparability (or equivalence) for OWL 2 QL ontologies and show that deciding query inseparability is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by experiments that they can be used for practical module extraction.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Artale, A.; Calvanese, D.; Kontchakov, R.; and Zakharyaschev, M. 2009. The DL-Lite family and relations.
    • Journal of Artificial Intelligence Research 36:1-69.
    • Baader, F.; Calvanese, D.; McGuinness, D.; Nardi, D.; and Patel-Schneider, P., eds. 2003. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press.
    • Baier, C., and Katoen, J.-P. 2007. Principles of Model Checking. MIT Press.
    • Botoeva, E.; Calvanese, D.; and Rodriguez-Muro, M. 2010.
    • of AIMSA, 21-31. Springer.
    • Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2006. Data complexity of query answering in description logics. In Proc. of KR, 260-270.
    • Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 39(3):385-429.
    • 2008. Modular reuse of ontologies: Theory and practice.
    • JAIR 31:273-318.
    • Dolby, J.; Fokoue, A.; Kalyanpur, A.; Ma, L.; Schonberg, E.; Srinivas, K.; and Sun, X. 2008. Scalable grounded conjunctive query evaluation over large and expressive knowledge bases. In Proc. of ISWC, v. 5318 of LNCS, 403-418.
    • Gra┬Ędel, E., and Walukiewicz, I. 1999. Guarded fixed point logic. In Proc. of LICS, 45-54.
    • 2008. Ontology reasoning with large data repositories. In Ontology Management, Semantic Web, Semantic Web Services, and Business Applications, Springer. 89-128.
    • Kontchakov, R.; Wolter, F.; and Zakharyaschev, M. 2010.
    • Logic-based ontology comparison and module extraction, with an application to DL-Lite. Artif. Intell. 174:1093-1141.
    • Lutz, C., and Wolter, F. 2010. Deciding inseparability and conservative extensions in the description logic E L. J. Symb.
    • Comput. 45(2):194-228.
    • Noy, N. F., and Musen, M. A. 2002. Promptdiff: A fixedpoint algorithm for comparing ontology versions. In Proc.
    • of AAAI/IAAI, 744-750.
    • Pan, J. Z., and Thomas, E. 2007. Approximating OWL-DL Ontologies. In Proc. of AAAI, 1434-1439.
    • Poggi, A.; Lembo, D.; Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Rosati, R. 2008. Linking data to ontologies. J. on Data Semantics X:133-173.
    • 2009. Modular Ontologies: Concepts, Theories and Techniques for Knowledge Modularization, v. 5445 of LNCS.
    • Vardi, M. Y. 1998. Reasoning about the past with two-way automata. In Proc. of ICALP, v. 1443 of LNCS, 628-641.
    • Proof. In case (a), the claim follows from Theorem 9, using (s1) and (s2) to obtain the required x0 associated with x 2 B IT2 .
    • In case (b), let B be a -concept and a -simulation of GT2 B . Let Ki = (Ti; B(a)). We show that MK2 B in GT1 is -homomorphically embeddable into MK1 . If B = A, then IK1 = fag. Therefore, (x) = a for all x 2 IK2 , and, whenever [R] T2 [S] for some S 2 , the role R is not generating, due to (s3). Set h( ) = a, for all 2 MK2 .
  • No related research data.
  • No similar publications.

Share - Bookmark

Funded by projects

  • RCUK | ExODA: Integrating Descrip...

Cite this article