BIROn - Birkbeck Institutional Research Online

    Browse by Person

    Up a level
    Export as [feed] Atom [feed] RSS
    Number of items: 34.

    Article

    Gottlob, G. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Schwentick, T. and Zakharyaschev, Michael (2014) The price of query rewriting in ontology-based data access. Artificial Intelligence 213 , pp. 42-59. ISSN 0004-3702.

    Calì, Andrea and Gottlob, G. and Kifer, M. (2013) Taming the infinite chase: query answering under expressive relational constraints. Journal of Artificial Intelligence Research 48 , pp. 115-174. ISSN 1076-9757.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2012) Towards more expressive ontology languages: the query answering problem. Artificial Intelligence 193 , pp. 87-128. ISSN 0004-3702.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2012) A general datalog-based framework for tractable query answering over ontologies. Web Semantics: Science, Services and Agents on the World Wide Web 14 , pp. 57-83. ISSN 1570-8268.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2012) Ontological query answering under expressive entity-relationship schemata. Information Systems 37 (4), pp. 320-335. ISSN 0306-4379.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. and Pieris, A. (2011) A logical toolbox for ontological reasoning. ACM SIGMOD Record 40 (3), pp. 5-14. ISSN 0163-5808.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2010) Query rewriting under non-guarded rules. Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management 619 , ISSN 1613-0073.

    Book Section

    Calì, Andrea (2017) Ontology querying: datalog strikes back. In: Ianni, G. and Lembo, D. and Bertossi, L. and Faber, W. and Glimm, B. and Gottlob, G. and Staab, S. (eds.) Reasoning Web. Semantic Interoperability on the Web. Lecture Notes in Computer Science 10370 10370. Springer, pp. 64-67. ISBN 9783319610320.

    Calì, Andrea and De Virgilio, R. and Di Noia, T. and Menichetti, L. and Mirizzi, R. and Nardini, L.M. and Ostuni, V.C. and Rebecca, F. and Ungania, M. (2014) Semantic search in RealFoodTrade. In: Gottlob, G. and Perez, J. (eds.) AMW - 2014 Alberto Mendelzon Workshop on Foundations of Data Management. CEUR Workshop Proceedings 1189. CEUR Workshop Proceedings.

    Poulovassilis, Alexandra (2013) Database research challenges and opportunities of big graph data. In: Gottlob, G. and Grasso, G. and Olteanu, D. and Schallhart, C. (eds.) Big Data. Berlin, Germany: Springer Verlag, pp. 29-32. ISBN 9783642394676.

    Kontchakov, Roman and Rodríguez-Muro, M. and Zakharyaschev, Michael (2013) Ontology-based data access with databases: a short course. In: Rudolph, S. and Gottlob, G. and Horrocks, I. and van Harmelen, F. (eds.) Reasoning Web. Semantic Technologies for Intelligent Data Access. Lecture Notes in Computer Science 8067. Berlin, Germany: Springer, pp. 194-229. ISBN 9783642397837.

    Calì, Andrea and Gottlob, G. and Orsi, G. and Pieris, A. (2012) On the interaction of existential rules and equality constraints in ontology querying. In: Erdem, E. and Lee, J. and Lierler, Y. and Pearce, D. (eds.) Correct Reasoning: Essays on Logic-Based AI in Honour of Vladimir Lifschitz. Lecture Notes in Computer Science 7265. Berlin, Germany: Springer, pp. 117-133. ISBN 9783642307423.

    Calì, Andrea and Gottlob, G. and Orsi, G. and Pieris, A. (2012) Querying UML class diagrams. In: Birkedal, L. (ed.) Foundations of Software Science and Computational Structures. Lecture Notes in Computer Science 7213. Berlin, Germany: Springer, pp. 1-25. ISBN 9783642287282.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. and Pieris, A. (2011) Datalog+/-: a family of languages for ontology querying. In: de Moor, O. and Gottlob, G. and Furche, T. and Sellers, A. (eds.) Datalog Reloaded. Lecture Notes in Computer Science 6702. London, UK: Springer, pp. 351-368. ISBN 9783642242069.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2011) New expressive languages for ontological query answering. In: Burgard, W. and Roth, D. (eds.) Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011. California, U.S.: AAAI Press, pp. 1541-1546. ISBN 9781577355076.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2011) Querying conceptual schemata with expressive equality constraints. In: Jeusfeld, M. and Delcambre, L. and Ling, T.-W. (eds.) Conceptual Modeling: ER 2011. Lecture Notes in Computer Science 6998. Berlin, Germany: Springer, pp. 161-174. ISBN 9783642246050.

    Calì, Andrea and Gottlob, G. and Kifer, M. and Lukasiewicz, T. and Pieris, A. (2010) Ontological reasoning with F-Logic Lite and its extensions. In: UNSPECIFIED (ed.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence. AAAI 10. Palo Alto, California, USA: AAAI Publications, pp. 1660-1665. ISBN 9781577354635.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2010) Advanced processing for ontological queries. In: UNSPECIFIED (ed.) 36th International Conference on Very Large Data Bases 2010 (VLDB 2010), Singapore, 13-17 September 2010. Proceedings of the VLDB Endowment 3. New York, U.S.: Association for Computing Machinery, pp. 554-565. ISBN 9781617820373.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. and Marnette, B. and Pieris, A. (2010) Datalog+/-: a family of logical knowledge representation and query languages for new applications. In: UNSPECIFIED (ed.) 25th Annual IEEE Symposium on Logic in Computer Science. Washington, USA: IEEE Computer Society, pp. 228-242. ISBN 9780769541143.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2010) Query answering under expressive entity-relationship schemata. In: Parsons, J. and Woo, C. and Saeki, M. and Shoval, P. and Wand, Y. (eds.) Conceptual Modeling. Lecture Notes in Computer Science 6412 6412. London, UK: Springer, pp. 347-361. ISBN 9783642163739.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2010) Query answering under non-guarded rules in datalog+/-. In: Pascal, H. and Thomas, L. (eds.) Web Reasoning and Rule. Systems Lecture Notes in Computer Science 6333. Berlin, Germany: Springer, pp. 1-17. ISBN 978-3-642-15917-6.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2010) Tractable query answering over conceptual schemata (extended abstract). In: Bergamaschi, S. and Lodi, S. and Martoglia, R. and Sartori, C. (eds.) Proceedings of the Eighteenth Italian Symposium on Advanced Database Systems, SEBD 2008, 22-25 June 2008, Mondello, PA, Italy. Bologna, Italy: Esculapio Editore, pp. 454-461. ISBN 9788874883691.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2009) Datalog extensions for tractable query answering over ontologies. In: de Virgilio, R. and Giunchiglia, F. and Tanca, L. (eds.) Semantic Web Information Management. Berlin, Germany: Springer, pp. 249-279. ISBN 9783642043284.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2009) Datalog±: a unified approach to ontologies and integrity constraints. In: Fagin, R. (ed.) Proceedings of the 12th International Conference on Database Theory - ICDT '09. ACM International Conference Proceeding Series 361. New York, U.S.: ACM Publications, pp. 14-30. ISBN 9781605584232.

    Calì, Andrea and Gottlob, G. and Pieris, A. (2009) Tractable query answering over conceptual schemata. In: Laender, A.H.F. and Castano, S. and Dayal, U. and Casati, F. and Oliverira, J.P.M. (eds.) 28th International Conference on Conceptual Modeling. Lecture Notes in Computer Science 5829. Berlin, Germany: Springer, pp. 175-190. ISBN 9783642048401.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2009) Tractable query answering over ontologies with datalog. In: Cuenca Grau, B. and Horrocks, I. and Motik, B. and Sattler, U. (eds.) Proceedings of the 22nd International Workshop on Description Logics (DL 2009), Oxford, UK, July 27-30, 2009. CEUR Workshop Proceedings 477. CEUR Workshop Proceedings.

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2009) A general datalog-based framework for tractable query answering over ontologies. In: Paredaens, J. and Su, J. (eds.) Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '09. New York, U.S.: ACM Publications, pp. 77-86. ISBN 9781605585536.

    Calì, Andrea and Gottlob, G. and Kifer, M. (2008) Taming the infinite chase: query answering under expressive relational constraints. In: Brewka, G. and Lang, J. (eds.) Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, KR 2008, Sydney, Australia, September 16-19, 2008. California, U.S.: AAAI Press, pp. 70-80. ISBN 9781577353843.

    Calì, Andrea and Gottlob, G. and Kifer, M. (2008) Taming the infinite chase: query answering under expressive relational constraints. In: Baader, F. and Lutz, C. and Motik, B. (eds.) Proceedings of the 21st International Workshop on Description Logics (DL2008), Dresden, Germany, May 13-16, 2008. CEUR Workshop Proceedings 353. CEUR Workshop Proceedings.

    Chen, Hubie (2003) Inverse circumscription. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 449-454.

    Calì, Andrea and Lembo, D. and Rosati, R. (2003) Query rewriting and answering under constraints in data integration systems. In: Gottlob, G. and Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 16-21.

    Wolter, F. and Zakharyaschev, M. (2003) Reasoning about distances. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 1275-1282.

    Chen, Hubie (2003) A theory of average-case compilability in knowledge representation. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 455-460.

    Conference or Workshop Item

    Gottlob, G. and Lanzinger, M. and Pichler, R. and Razgon, Igor (2020) Fractional covers of Hypergraphs with bounded multi-intersection. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), 24-28 Oct 2020, Prague, Czech Republic.

    This list was generated on Mon Dec 23 06:53:29 2024 GMT.