-
1
-
-
84976783056
-
The implication problem for data dependencies
-
C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. of ICALP, pages 73-85, 1981.
-
(1981)
Proc. of ICALP
, pp. 73-85
-
-
Beeri, C.1
Vardi, M.Y.2
-
2
-
-
84956864613
-
Accessing data integration systems through conceptual schemas
-
A. Calì, D. Calvanese, G. D. Giacomo, andM. Lenzerini. Accessing data integration systems through conceptual schemas. In Proc. of ER, pages 270-284, 2001.
-
(2001)
Proc. of ER
, pp. 270-284
-
-
Calì, A.1
Calvanese, D.2
Giacomo, G.D.3
Lenzerini, M.4
-
3
-
-
84860514494
-
Taming the infinite chase: Query answering under expressive relational constraints
-
A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, pages 70-80, 2008.
-
(2008)
Proc. of KR
, pp. 70-80
-
-
Calì, A.1
Gottlob, G.2
Kifer, M.3
-
4
-
-
70350662981
-
A general datalog-based framework for tractable query answering over ontologies
-
A. Calì, G. Gottlob, and T. Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, pages 77-86, 2009.
-
(2009)
Proc. of PODS
, pp. 77-86
-
-
Calì, A.1
Gottlob, G.2
Lukasiewicz, T.3
-
6
-
-
35348926643
-
Containment of conjunctive object meta-queries
-
A. Calì and M. Kifer. Containment of conjunctive object meta-queries. In Proc. of VLDB, pages 942-952, 2006.
-
(2006)
Proc. of VLDB
, pp. 942-952
-
-
Calì, A.1
Kifer, M.2
-
7
-
-
1142299764
-
Decidability and complexity of query answering over incosistent and incomplete databases
-
A. Calì, D. Lembo, and R. Rosati. Decidability and complexity of query answering over incosistent and incomplete databases. In Proc. of PODS, pages 260-271, 2003.
-
(2003)
Proc. of PODS
, pp. 260-271
-
-
Calì, A.1
Lembo, D.2
Rosati, R.3
-
8
-
-
84880843747
-
Query rewriting and answering under constraints in data integration systems
-
A. Calì, D. Lembo, and R. Rosati. Query rewriting and answering under constraints in data integration systems. In Proc. of IJCAI, pages 16-21, 2003.
-
(2003)
Proc. of IJCAI
, pp. 16-21
-
-
Calì, A.1
Lembo, D.2
Rosati, R.3
-
9
-
-
77957277345
-
Querying incomplete data over extended ER schemata
-
to appear
-
A. Calì and D. Martinenghi. Querying incomplete data over extended er schemata. TPLP, 2010. to appear.
-
(2010)
TPLP
-
-
Calì, A.1
Martinenghi, D.2
-
10
-
-
34548305118
-
Tractable reasoning and efficient query answering in description logics: The DL-lite family
-
D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Autom. Reasoning, 39(3):385-429, 2007.
-
(2007)
J. Autom. Reasoning
, vol.39
, Issue.3
, pp. 385-429
-
-
Calvanese, D.1
De Giacomo, G.2
Lembo, D.3
Lenzerini, M.4
Rosati, R.5
-
11
-
-
45749133516
-
Conjunctive query containment and answering under description logic constraints
-
D. Calvanese, G. D. Giacomo, and M. Lenzerini. Conjunctive query containment and answering under description logic constraints. ACM Trans. Comput. Log., 9(3), 2008.
-
(2008)
ACM Trans. Comput. Log.
, vol.9
, Issue.3
-
-
Calvanese, D.1
Giacomo, G.D.2
Lenzerini, M.3
-
12
-
-
84958776545
-
Optimal implementation of conjunctive queries in relational data bases
-
A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, pages 77-90, 1977.
-
(1977)
Proc. of STOCS
, pp. 77-90
-
-
Chandra, A.K.1
Merlin, P.M.2
-
15
-
-
18144386595
-
Data exchange: Semantics and query answering
-
R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
-
(2005)
Theor. Comput. Sci.
, vol.336
, Issue.1
, pp. 89-124
-
-
Fagin, R.1
Kolaitis, P.G.2
Miller, R.J.3
Popa, L.4
-
16
-
-
0005484460
-
Decidability issues for action guarded logics
-
M. E. Goncalves and E. Grädel. Decidability issues for action guarded logics. In Description Logics, pages 123-132, 2000.
-
(2000)
Description Logics
, pp. 123-132
-
-
Goncalves, M.E.1
Grädel, E.2
-
17
-
-
0021375730
-
Testing containment of conjunctive queries under functional and inclusion dependencies
-
D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984.
-
(1984)
J. Comput. Syst. Sci.
, vol.28
, Issue.1
, pp. 167-189
-
-
Johnson, D.S.1
Klug, A.C.2
-
18
-
-
0029333530
-
Logical foundations of object-oriented and frame-based languages
-
M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and frame-based languages. J. ACM, 42(4):741-843, 1995.
-
(1995)
J. ACM
, vol.42
, Issue.4
, pp. 741-843
-
-
Kifer, M.1
Lausen, G.2
Wu, J.3
-
19
-
-
0018699134
-
Testing implications of data dependencies
-
D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
-
(1979)
ACM Trans. Database Syst.
, vol.4
, Issue.4
, pp. 455-469
-
-
Maier, D.1
Mendelzon, A.O.2
Sagiv, Y.3
-
22
-
-
67549104757
-
Linking data to ontologies
-
A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.
-
(2008)
J. Data Semantics
, vol.10
, pp. 133-173
-
-
Poggi, A.1
Lembo, D.2
Calvanese, D.3
De Giacomo, G.4
Lenzerini, M.5
Rosati, R.6
-
23
-
-
38149052892
-
DNC: Decidable non-monotonic disjunctive logic programs with function symbols
-
M. Simkus and T. Eiter. DNC: Decidable non-monotonic disjunctive logic programs with function symbols. In Proc. of LPAR, pages 514-530, 2007.
-
(2007)
Proc. of LPAR
, pp. 514-530
-
-
Simkus, M.1
Eiter, T.2
-
24
-
-
0029204108
-
On the complexity of bounded-variable queries
-
M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. of PODS, pages 266-276, 1995.
-
(1995)
Proc. of PODS
, pp. 266-276
-
-
Vardi, M.Y.1
|