Rewriting conjunctive queries over description logic knowledge bases

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

Volumn 4925 LNCS, Issue , 2008, Pages 199-214

  Pérez Urbina, Héctor ^a   Motik, Boris ^a   Horrocks, Ian ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; DATA DESCRIPTION; FORMAL LANGUAGES; INFORMATION ANALYSIS; ONTOLOGY; SEMANTICS;

CONJUNCTIVE QUERIES; DATA COMPLEXITY; DESCRIPTION LOGIC; EXTENDED VERSIONS; INFORMATION INTEGRATION SYSTEM; KNOWLEDGE BASIS; QUERY ANSWERING; QUERY REWRITINGS;

SEARCH ENGINES;

EID: 57349133679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88594-8_11     Document Type: Conference Paper

References (18)

1. Baader, F., Brandt, S., Lutz, C.: Pushing the EL Envelope. In: Proc. IJCAI 2005, Edinburgh, Scotland, pp. 364-369 (2005)
2. Baader, F., Nutt, W.: Basic Description Logics, eh. 2, pp. 47-100. Cambridge University Press, Cambridge (2003)
3. Baader, F., Snyder, W.: Unification theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 8, vol. I, pp. 445-532. Elsevier Science, Amsterdam (2001)
4. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch.2, vol. 1, pp. 19-100. North Holland, Amsterdam (2001)
5. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rosati, R.: MASTRO-I: Efficient integration of relational data through DL ontologies. In: DL 2007 (2007)
6. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in Description Logics. In: Proc. DL 2005 (2005)
7. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. of Automated Reasoning 9, 385-429 (2007)
8. Grädel, E.: Capturing complexity classes by fragments of second-order logic. Theor. Comput. Sei. 101, 35-57 (1992)
9. Green, C.: Theorem proving by resolution as a basis for question-answering systems. In: Meltzer, B., Michie, D. (eds.) 4th Annual Machine Intelligence Workshop, pp. 183-208. Edinburgh University Press (1969)
10. Halevy, A.Y.: Answering queries using views: A survey. The VLDB Journal 10(4), 270-294 (2001)
11. Heflin, J., Hendler, J.: A portrait of the semantic web in action. IEEE Intelligent Systems 16(2), 54-59 (2001)
12. Joyner, W.H.: Resolution strategies as decision procedures. J. ACM 23(3), 398-417 (1976)
13. Kanellakis, P.C., Kuper, G.M., Revesz, P.Z.: Constraint query languages. In: Proc. PODS 1990, pp. 299-313 (1990)
14. Lee, J., Siau, K., Hong, S.: Enterprise integration with ERP and EAI. Commun. ACM 46(2), 54-60 (2003)
15. Lenzerini, M.: Data Integration: a theoretical perspective. In: Proc. PODS 2002, pp. 233-246. ACM Press, New York (2002)
16. Motik, B.: Reasoning in Description Logics using Resolution and Deductive Databases. PhD thesis, Univesität Karlsruhe (TH), Karlsruhe, Germany (January 2006)
17. De Nivelle, H., Schmidt, R.A., Hustadt, U.: Resolution-Based Methods for Modal Logics. Logic Journal of the IGPL 8(3), 265-292 (2000)
18. Rosati, R.: On conjunctive query answering in EL. In: In Proceedings of CEUR Electronic Workshop, DL2007 (2007)