Non-uniform data complexity of query answering in description logics

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2012, Pages 297-307

  Lutz, Carsten ^a   Wolter, Frank ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; FORMAL LANGUAGES; KNOWLEDGE REPRESENTATION;

COMPLEXITY MEASURES; DATA COMPLEXITY; DESCRIPTION LOGIC; NON UNIFORM DATA; ONTOLOGY-BASED DATA ACCESS; QUERY ANSWERING; TYPICAL APPLICATION;

ONTOLOGY;

EID: 84893399815     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (48)

1. Allender, E.; Bauland, M.; Immerman, N.; Schnoor, H.; and Vollmer, H. 2005. The complexity of satisfiability problems: Refining Schaefer's theorem. In MFCS, 71-82.
2. Artale, A.; Calvanese, D.; Kontchakov, R.; and Za-kharyaschev, M. 2009. The DL-Lite family and relations. J. Artif. Intell. Res. (JAIR) 36:1-69.
3. Baader, F.; Calvanese, D.; McGuiness, D.; Nardi, D.; and Patel-Schneider, P. 2003. The Description Logic Handbook: Theory, implementation and applications. Cambridge University Press.
4. Baader, F; Bienvenu, M.; Lutz, C; and Wolter, F. 2010. Query and predicate emptiness in description logics. In KR.
5. Baader, F.; Brandt, S.; and Lutz, C. 2005. Pushing the EL envelope. In IJCAI, 364-369. Professional Book Center.
6. Baget, J.-F; Mugnier, M.-L.; Rudolph, S.; and Thomazo, M. 2011. Walking the complexity lines for generalized guarded existential rules. In IJCAI, 712-717.
7. Barany, V.; Gottlob, G.; and Otto, M. 2010. Querying the guarded fragment. In LICS, 1-10.
8. Bulatov, A. A.; Jeavons, P.; and Krokhin, A. A. 2005. Classifying the complexity of constraints using finite algebras. SIAM J. Comput. 34(3):720-742.
9. Bulatov, A. A.; Krokhin, A. A.; and Larose, B. 2008. Dualities for constraint satisfaction problems. In Complexity of Constraints, 93-124.
10. Bulatov, A. A. 2002. A dichotomy theorem for constraints on a three-element set. In FOCS, 649-658.
11. Bulatov, A. A. 2011. On the CSP dichotomy conjecture. In CSR, 331-344.
12. Calvanese, D.; Giacomo, G. D.; Lenzerini, M.; and Vardi, M. Y. 2000. View-based query processing and constraint satisfaction. In LICS, 361-371.
13. Calvanese, D.; Giacomo, G. D.; Lenzerini, M.; and Vardi, M. Y. 2003a. Reasoning on regular path queries. SIGMOD Record 32(4):83-92.
14. Calvanese, D.; Giacomo, G. D.; Lenzerini, M.; and Vardi, M. Y. 2003b. View-based query containment. In PODS, 56-67.
15. Calvanese, D.; Giacomo, G. D.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2006. Data complexity of query answering in description logics. In KR, 260-270.
16. 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 Autom. Reasoning 39(3):385-429.
17. Chang, C. C., and Keisler, H. J. 1990. Model Theory, Volume 73 of Studies in Logic and the Foundations of Mathematics. Elsevier.
18. Cosmadakis, S. S.; Gaifman, H.; Kanellakis, P. C.; and Vardi, M. Y. 1988. Decidable optimization problems for database logic programs (preliminary report). In STOC, 477-490.
19. Dechter, R. 2003. Constraint processing. Elsevier Morgan Kaufmann.
20. 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 ISWC, 403-418.
21. Eiter, T.; Gottlob, G.; Ortiz, M.; and Simkus, M. 2008. Query answering in the description logic Horn-SHIQ. In JELIA, 166-179.
22. Feder, T., and Vardi, M. Y. 1993. Monotone monadic SNP and constraint satisfaction. In STOC, 612-622.
23. Gaifman, H.; Mairson, H. G.; Sagiv, Y.; and Vardi, M. Y. 1987. Undecidable optimization problems for database logic programs. In LICS, 106-115.
24. Glimm, B.; Lutz, C.; Horrocks, I.; and Sattler, U. 2008. Conjunctive query answering for the description logic SHIQ. JAIR 31:157-204.
25. Hell, P., and Nesetril, J. 1990. On the complexity of h-coloring. J. Comb. Theory, Ser. B 48(1):92-110.
26. Hustadt, U.; Motik, B.; and Sattler, U. 2007. Reasoning in description logics by a reduction to disjunctive datalog. J. Autom. Reasoning 39(3):351-384.
27. Kazakov, Y. 2009. Consequence-driven reasoning for Horn-SHIQ ontologies. In Boutilier, C., ed., IJCAI, 2040-2045.
28. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2010. The combined approach to query answering in DL-Lite. In KR.
29. Krisnadhi, A., and Lutz, C. 2007. Data complexity in the EL family of description logics. In LPAR, 333-347.
30. Krokhin, A. A. 2010. Tree dualities for constraint satisfaction. In CSL, 32-33.
31. Krötzsch, M.; Rudolph, S.; and Hitzler, P. 2007. Complexity boundaries for Horn description logics. In AAAI, 452-457.
32. Krötzsch, M. 2010. Efficient inferencing for OWL EL. In JELIA, 234-246.
33. Kun, G., and Szegedy, M. 2009. A new line of attack on the dichotomy conjecture. In STOC, 725-734.
34. Ladner, R. E. 1975. On the structure of polynomial time reducibility. J. ACM 22(1):155-171.
35. Larose, B.; Loten, C.; and Tardif, C. 2007. A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer Science 3(4).
36. Lutz, C., and Wolter, F. 2011. Non-uniform data complexity of query answering in description logics. In Description Logics.
37. Lutz, C.; Piro, R.; and Wolter, F. 2011. Description logic tboxes: Model-theoretic characterizations and rewritability. In IJCAI.
38. Lutz, C.; Toman, D.; and Wolter, F. 2009. Conjunctive query answering in the description logic EL using a relational database system. In IJCAI, 2070-2075.
39. Makowsky, J. A. 1987. Why Horn formulas matter in computer science: Initial structures and generic examples. J. Comput. Syst. Sci. 34(2/3):266-292.
40. Malcev, A. 1971. The metamathematics of algebraic systems, collected papers:1936-1967. North-Holland.
41. Meseguer, J., and Goguen, J. 1985. Initiality, induction, and computability. In Algebraic Methods in Semantics. Cambridge University Press. 459-541.
42. Nesetril, J., and Tardif, C. 2000. Duality theorems for finite structures (characterising gaps and good characterisations). J. Comb. Theory, Ser. B 80(1):80-97.
43. Nesetril, J. 2009. Many facets of dualities. In Research Trends in Combinatorial Optimization. 285-302.
44. Otto, M.; Blumensath, A.; and Weyer, M. 2010. Decidability results for the boundedness problem. Technical report, TU Darmstadt.
45. Poggi, A.; Lembo, D.; Calvanese, D.; Giacomo, G. D.; Lenzerini, M.; and Rosati, R. 2008. Linking data to ontologies. J. Data Semantics 10:133-173.
46. Pratt, V. R. 1979. Models of program logics. In FOCS, 115-122.
47. Schaefer, T. J. 1978. The complexity of satisfiability problems. In STOC, 216-226.
48. Schaerf, A. 1993. On the complexity of the instance checking problem in concept languages with existential quantification. J. of Intel. Inf. Systems 2:265-278.