Databases Reference
In-Depth Information
64. Calı, A., Gottlob, G., Kifer, M.: Taming the infinite chase: Query answering under ex-
pressive relational constraints. In: Brewka, G., Lang, J. (eds.) Proceedings of the Eleventh
International Conference on Principles of Knowledge Representation and Reasoning (KR
2008), pp. 70-80. AAAI Press (2008)
65. Fagin, R., Kolaitis, P.G., Miller, R.J., Popa, L.: Data exchange: semantics and query an-
swering. Theoretical Computer Science 336(1), 89-124 (2005)
66. Calı, A., Gottlob, G., Pieris, A.: Advanced processing for ontological queries. Proceedings
of the VLDB Endowment 3(1), 554-565 (2010)
67. Calı, A., Gottlob, G., Pieris, A.: Towards more expressive ontology languages: The query
answering problem. Artificial Intelligence 193, 87-128 (2012)
68. Leone, N., Manna, M., Terracina, G., Veltri, P.: Efficiently computable datalog
∃
programs.
In: Brewka, G., Eiter, T., McIlraith, S. (eds.) Proceedings of the 13th International Confer-
ence on Principles of Knowledge Representation and Reasoning (KR 2012). AAAI Press
(2012)
69. Alviano, M., Faber, W., Leone, N., Manna, M.: Disjunctive datalog with existential quan-
tifiers: Semantics, decidability, and complexity issues. In: Theory and Practice of Logic
Programming, 28th Int'l. Conference on Logic Programming (ICLP 2012) (2012); Special
Issue 12(4-5), 701-718 (July 2012)
70. Gottlob, G., Manna, M., Morak, M., Pieris, A.: On the complexity of ontological reasoning
under disjunctive existential rules. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS
2012. LNCS, vol. 7464, pp. 1-18. Springer, Heidelberg (2012)
71. Pierre Bourhis, M.M., Pieris, A.: The impact of disjunction on ontological query answer-
ing under guarded-based existential rules. In: Proceedings of the 23rd International Joint
Conference on Artificial Intelligence (IJCAI 2013) (2013)
72. Kr otzsch, M., Rudolph, S.: Extending decidable existential rules by joining acyclicity and
guardedness. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on
Artificial Intelligence (IJCAI 2011), pp. 963-968 (2011)
73. Calı, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable
query answering over ontologies. Journal of Web Semantics 14, 57-83 (2012)
74. Pearce, D., Valverde, A.: Quantified equilibrium logic and foundations for answer set
programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366,
pp. 546-560. Springer, Heidelberg (2008)
75. Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone,
N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol. 3662, pp. 119-131. Springer,
Heidelberg (2005)
76. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Twentieth In-
ternational Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 372-379 (January
2007)
77. Brewka, G.: Answer Sets: From Constraint Programming Towards Qualitative Optimiza-
tion. In: Lifschitz, V., Niemela, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 34-46.
Springer, Heidelberg (2003)
78. Delgrande, J.P., Schaub, T., Tompits, H.: A Framework for Compiling Preferences in Logic
Programs. Theory and Practice of Logic Programming 3(2), 129-187 (2003)
79. Brewka, G., Eiter, T.: Preferred Answer Sets for Extended Logic Programs. Artificial Intel-
ligence 109(1-2), 297-356 (1999)
80. Wang, K., Zhou, L., Lin, F.: Alternating Fixpoint Theory for Logic Programs with Priority.
In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau,
K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164-178.
Springer, Heidelberg (2000)
