Andrea Cali

Senior Lecturer at the Department of Computer Science and Information Systems, University of London, Birkbeck College

Andrea Calì is a Senior Lecturer at the Department of Computer Science and Information Systems of the University of London, Birkbeck College. He holds a MEng in Electronic Engineering and a PhD in Computer Engineering, both from the University of Rome "La Sapienza". His research interests include Database Theory, Deep Web, Semantic Web and Ontology Reasoning, Information Integration and Linked Data querying. Among other interests, he investigates the computational complexity of fundamental problems in data processing under knowledge bases. His is currently researching how to automatically integrate Web data in decision support and matchmaking systems.


Published Research

Cali, A. and Pieris, A. (2010). On equality-generating dependencies in ontology querying (extended abstract). . Proc. of SEBD.
Cali, A., Gottlob, G. and Pieris, A. (2012). Towards more expressive ontology languages: The query answering problem. Artificial Intelligence. 193. 87-128.
Cali, A., Gottlob, G., Giorgio, O. and Pieris, A. (2012). On the interaction of existential rules and equality constraints in ontology querying. Correct Reasoning Lecture Notes in Computer Science Volume. 7265. 117-133.
Cali, A., Gottlob, G. and Pieris, A. (2012). An ontological query answering under expressive entity-relationship schemata. Information Systems. 37 (4). 320-335.
Cali, A., Gottlob, G. and Pieris, A. (2011). New expressive languages for ontological query answering. Proceedings of AAAI. tbc. tbc.
Calo, A., Gottlob, G. and Pieris, A. (2011). Querying conceptual schemata with expressive equality constraints. Proceedings of ER. tbc. tbc.
Cali, A., Gottlob, G. and Pieris, A. (2010). Query answering under non-guarded rules in Datalog=/-. Proc. of RR. tbc. 1-17.
Cali, A., Gottlob, G. and Pieris, A. (2010). Advanced processing for ontological queries. Proceedings of VLDB. 3 (1). 554-565.
Gottlob, G., Cali, A. and Pieris, A. (2010). Query rewriting under non-guarded rules. Proceedings of AMW. tbc. tbc.
Cali, A., Gottlob, G. and Pieris, A. (2010). Query answering under expressive entity-relationship schemata. Proceedings of ER. tbc. 347-361.
Gottlob, G., Cali, A., Lukasiewic, T., Kifer, M. and Pieris, A. (2010). Ontological reasoning with F-Logic lite and its extensions. Proceedings of AAAI. tbc. tbc.
Cali, A., Gottlob, G. and Pieris, A. (2009). Tractable query answering over conceptual schemeta. Lecture Notes in Computer Science. 5829 . 175-190.
Cali, A., Calvanese, D. and Martinenghi, D. (2009). Dynamic query optimization under access limitations and dependencies. Journal of Universal Computer Science. 15 (1). 33-62.
Cali, A., Gottlob, G. and Lukasiewicz, T. (2009). A unified approach to ontologies and integrity constraints. 12th International Conference on Database Theory Proceedings. tba. 14-30.
Cali, A., Gottlob, G. and Lukasiewicz, T. (2009). +/-: A powerful family of languages for query answering over ontologies. 12th International Conference of Database Theorys Proceedings. tba. tba.
Cali, A., Gottlob, G. and Lukasiewicz, T. (2009). A general datalog-based framework for tractable qurey answering over ontologies. 28th ACM Symposium on Principles of Database Systems Proceedings. tbc. 77-86.
Cali, A., Lukasiewicz, T., Predoiu, L. and Stuckenschmidt, H. (2009). Tightly coupled probabilistic description logic programs for the semantic web. Journal on Data Semantics 12. 5480. 95-130.
Cali, A. and Lukasiewicz, T. (2008). An approach to probabilistic data integration for the semantic web. Uncertainty Reasoning for the Semantic web. Lecture Notes in Computer Science. 5327. 52-65.
Cali, A., Lukasiewicz, T., Predoiu, L. and Stuckenschmidt, H. (2008). Tightly integrated probabilistic description logic programs for representing ontology mappings. 5th International Symposium on Foundations of Information and Knowledge Systems proceedings. tbc. 178-198.
Cali, A., Gottlob, G. and Kifer, M. (2008). 11th International Conference on Knowledge Representation and Reasoning 2008 proceedings. tba: tba. 70-80.