-
1
-
-
57049148579
-
-
http://www.w3.org/TR/rdf-schema/
-
-
-
-
2
-
-
77957599502
-
Pushing the ε L envelope
-
Baader, F., Brandt, S., Lutz, C.: Pushing the ε L envelope. In: Proc. of IJCAI 2005, pp. 364-369 (2005)
-
(2005)
Proc. of IJCAI
, pp. 364-369
-
-
Baader, F.1
Brandt, S.2
Lutz, C.3
-
3
-
-
0003727420
-
-
Baader, F, Calvanese, D, McGuinness, D, Nardi, D, Patel-Schneider, P.F, eds, Cambridge University Press, Cambridge
-
Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, Cambridge (2003)
-
(2003)
The Description Logic Handbook: Theory, Implementation and Applications
-
-
-
4
-
-
0003359740
-
The undecidability of the dominoe problem
-
Berger, R.: The undecidability of the dominoe problem. Mem. Amer. Math. Soc. 66, 1-72 (1966)
-
(1966)
Mem. Amer. Math. Soc
, vol.66
, pp. 1-72
-
-
Berger, R.1
-
5
-
-
29344454351
-
DL-Lite: Tractable description logics for ontologies
-
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: DL-Lite: Tractable description logics for ontologies. In: Proc. of AAAI 2005, pp. 602-607 (2005)
-
(2005)
Proc. of AAAI 2005
, pp. 602-607
-
-
Calvanese, D.1
De Giacomo, G.2
Lembo, D.3
Lenzerini, M.4
Rosati, R.5
-
6
-
-
34548324704
-
Data complexity of query answering in description logics
-
Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: Data complexity of query answering in description logics. In: Proc. of KR 2006 (2006)
-
(2006)
Proc. of KR
-
-
Calvanese, D.1
De Giacomo, G.2
Lembo, D.3
Lenzerini, M.4
Rosati, R.5
-
7
-
-
0031628670
-
On the decidability of query containment under constraints
-
Calvanese, D., De Giacomo, G., Lenzerini, M.: On the decidability of query containment under constraints. In: Proc. of PODS 1998, pp. 149-158 (1998)
-
(1998)
Proc. of PODS 1998
, pp. 149-158
-
-
Calvanese, D.1
De Giacomo, G.2
Lenzerini, M.3
-
8
-
-
84880863877
-
Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination
-
de Bruijn, J., Eiter, T., Polleres, A., Tompits, H.: Embedding non-ground logic programs into autoepistemic logic for knowledge-base combination. In: Proc. of IJCAI 2007 (2007)
-
(2007)
Proc. of IJCAI
-
-
de Bruijn, J.1
Eiter, T.2
Polleres, A.3
Tompits, H.4
-
9
-
-
0031237090
-
Disjunctive Datalog
-
Eiter, T., Gottlob, G., Mannilla, H.: Disjunctive Datalog. ACM Trans, on Database Systems 22(3), 364-418 (1997)
-
(1997)
ACM Trans, on Database Systems
, vol.22
, Issue.3
, pp. 364-418
-
-
Eiter, T.1
Gottlob, G.2
Mannilla, H.3
-
10
-
-
33746067855
-
-
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, 4011, pp. 273-287. Springer, Heidelberg (2006)
-
Eiter, T., Ianni, G., Schindlauer, R., Tompits, H.: Effective integration of declarative rules with external evaluations for semantic-web reasoning. In: Sure, Y., Domingue, J. (eds.) ESWC 2006. LNCS, vol. 4011, pp. 273-287. Springer, Heidelberg (2006)
-
-
-
-
11
-
-
57049092827
-
-
Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Proc. of KR 2004, pp. 141-151 (2004)
-
Eiter, T., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. In: Proc. of KR 2004, pp. 141-151 (2004)
-
-
-
-
12
-
-
77951505493
-
Classical negation in logic programs and disjunctive databases
-
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385 (1991)
-
(1991)
New Generation Computing
, vol.9
, pp. 365-385
-
-
Gelfond, M.1
Lifschitz, V.2
-
13
-
-
84880883540
-
Conjunctive query answering for the description logic SHIQ
-
Glimm, B., Horrocks, I., Lutz, C., Sattler, U.: Conjunctive query answering for the description logic SHIQ. In: Proc. of IJCAI 2007, pp. 399-404 (2007)
-
(2007)
Proc. of IJCAI
, pp. 399-404
-
-
Glimm, B.1
Horrocks, I.2
Lutz, C.3
Sattler, U.4
-
14
-
-
47149085842
-
-
Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query answering for description logics with transitive roles. In: Proc. of DL 2006. Proceedings of CEUR Electronic Workshop (2006), http://ceur-ws.org/189
-
Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query answering for description logics with transitive roles. In: Proc. of DL 2006. Proceedings of CEUR Electronic Workshop (2006), http://ceur-ws.org/Vol-189
-
-
-
-
15
-
-
57049135243
-
Conjunctive query answering for the description logic SHOIQ
-
Technical report, University of Manchester, UK
-
Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query answering for the description logic SHOIQ. Technical report, University of Manchester, UK (2006)
-
(2006)
-
-
Glimm, B.1
Horrocks, I.2
Sattler, U.3
-
16
-
-
19944424169
-
A possible simplification of the semantic web architecture
-
Grau, B.C.: A possible simplification of the semantic web architecture. In: Proc. of the 13th Int. World Wide Web Conf. (WWW 2004), pp. 704-713 (2004)
-
(2004)
Proc. of the 13th Int. World Wide Web Conf. (WWW
, pp. 704-713
-
-
Grau, B.C.1
-
17
-
-
42949162880
-
Guarded hybrid knowledge bases
-
Heymans, S., de Bruijn, J., Predoiu, L., Feier, C., Nieuwenborgh, D.V.: Guarded hybrid knowledge bases. Theory and Practice of Logic Programming 8(3), 411-429 (2008)
-
(2008)
Theory and Practice of Logic Programming
, vol.8
, Issue.3
, pp. 411-429
-
-
Heymans, S.1
de Bruijn, J.2
Predoiu, L.3
Feier, C.4
Nieuwenborgh, D.V.5
-
19
-
-
84880733253
-
Data complexity of reasoning in very expressive description logics
-
Hustadt, U., Motik, B., Sattler, U.: Data complexity of reasoning in very expressive description logics. In: Proc. of IJCAI 2005, pp. 466-471 (2005)
-
(2005)
Proc. of IJCAI
, pp. 466-471
-
-
Hustadt, U.1
Motik, B.2
Sattler, U.3
-
20
-
-
0032156942
-
Combining Horn rules and description logics in CARIN
-
Levy, A.Y., Rousset, M.-C.: Combining Horn rules and description logics in CARIN. Artificial Intelligence 104(1-2), 165-209 (1998)
-
(1998)
Artificial Intelligence
, vol.104
, Issue.1-2
, pp. 165-209
-
-
Levy, A.Y.1
Rousset, M.-C.2
-
21
-
-
34548093062
-
-
Lukasiewicz, T.: A novel combination of answer set programming with description logics for the semantic web. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, 4519, pp. 384-398. Springer, Heidelberg (2007)
-
Lukasiewicz, T.: A novel combination of answer set programming with description logics for the semantic web. In: Franconi, E., Kifer, M., May, W. (eds.) ESWC 2007. LNCS, vol. 4519, pp. 384-398. Springer, Heidelberg (2007)
-
-
-
-
22
-
-
84880854013
-
A faithful integration of description logics with logic programming
-
to appear
-
Motik, B., Rosati, R.: A faithful integration of description logics with logic programming. In: Proc. of IJCAI 2007 (to appear, 2007)
-
(2007)
Proc. of IJCAI
-
-
Motik, B.1
Rosati, R.2
-
23
-
-
21244502056
-
Query answering for OWL-DL with rules
-
Motik, B., Sattler, U., Studer, R.: Query answering for OWL-DL with rules. J. of Web Semantics 3(1), 41-60 (2005)
-
(2005)
J. of Web Semantics
, vol.3
, Issue.1
, pp. 41-60
-
-
Motik, B.1
Sattler, U.2
Studer, R.3
-
24
-
-
36349006589
-
Characterizing data complexity for conjunctive query answering in expressive description logics
-
Ortiz, M.M., Calvanese, D., Eiter, T.: Characterizing data complexity for conjunctive query answering in expressive description logics. In: Proc. of AAAI 2006 (2006)
-
(2006)
Proc. of AAAI
-
-
Ortiz, M.M.1
Calvanese, D.2
Eiter, T.3
-
25
-
-
57049170371
-
-
Ortiz de la Fuente, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. Technical report, Fac.of Computer Science, Free Univ.of Bozen-Bolzano (March 2006), http://www.inf. unibz.it/calvanese/papers/orti-calv-eite-TR-2006-03.pdf
-
Ortiz de la Fuente, M.M., Calvanese, D., Eiter, T.: Data complexity of answering unions of conjunctive queries in SHIQ. Technical report, Fac.of Computer Science, Free Univ.of Bozen-Bolzano (March 2006), http://www.inf. unibz.it/calvanese/papers/orti-calv-eite-TR-2006-03.pdf
-
-
-
-
26
-
-
4644260332
-
OWL web ontology language; semantics and abstract syntax
-
November 2002
-
Patel-Schneider, P.F., Hayes, P.J., Horrocks, I., van Harmelen, F.: OWL web ontology language; semantics and abstract syntax. W3C candidate recommendation (November 2002), http://www.w3.org/tr/owl-semantics/
-
W3C candidate recommendation
-
-
Patel-Schneider, P.F.1
Hayes, P.J.2
Horrocks, I.3
van Harmelen, F.4
-
27
-
-
21244492715
-
On the decidability and complexity of integrating ontologies and rules
-
Rosati, R.: On the decidability and complexity of integrating ontologies and rules. J. of Web Semantics 3(1), 61-73 (2005)
-
(2005)
J. of Web Semantics
, vol.3
, Issue.1
, pp. 61-73
-
-
Rosati, R.1
-
28
-
-
84860600786
-
-
DL+log: tight integration of Description Logics and disjunctive Datalog
-
Rosati, R.: DL+log: tight integration of Description Logics and disjunctive Datalog. In: Proc. of KR 2006, pp. 68-78 (2006)
-
(2006)
Proc. of KR
, pp. 68-78
-
-
Rosati, R.1
-
29
-
-
84878705786
-
-
Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, 4353, pp. 164-178. Springer, Heidelberg (2007)
-
Rosati, R.: The limits of querying ontologies. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 164-178. Springer, Heidelberg (2007)
-
-
-
|