Searchable List of Research Output

Filter Publications
  • Tedeschi, S., Bos, J., Declerck, T., Hajič, J., Hershcovich, D., Hovy, E.H., Koller, A., Krek, S., Schockaert, S., Sennrich, R., Shutova, E., Navigli, R. (2023) What's the Meaning of Superhuman Performance in Today's NLU?.
    In Rogers, A. Boyd-Graper, J. Okazaki, N. (Eds.), The 61st Conference of the Association for Computational Linguistics: ACL 2023 : Proceedings of the Conference : July 9-14, 2023 (pp 12471-12491). Association for Computational Linguistics.
  • Tel, G., Vitányi, P. (1994) Distributed algorithms: 8th international workshop, WDAG '1994, Terschelling, The Netherlands, September 29 -October 1, 1994: proceedings.
    Lecture Notes in Computer Science. Springer.
  • ten Cate, B., Comer, J. (2024) Craig Interpolation for Decidable First-Order Fragments.
    In Kobayashi, N. Worrell, J. (Eds.), Foundations of Software Science and Computation Structures: 27th International Conference, FoSSaCS 2024 : held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024 : proceedings (pp 137-159) (Lecture Notes in Computer Science
    Advanced Research in Computing and Software Science, Vol. 14575). Springer.
  • ten Cate, B., Comer, J. (2025) Craig Interpolation for Decidable First-Order Fragments.
    Logical Methods in Computer Science, Vol. 21
  • ten Cate, B., Conradie, W., Marx, M., Venema, Y. (2006) Definitorially Complete Description Logics.
    In Doherty, P. Mylopoulos, J. Welty, C. (Eds.), Proceedings of KR 2006 (pp 79-89). AAAI Press.
    Conference contribution | UvA-DARE
  • ten Cate, B., Dalmau, V., Funk, M., Lutz, C. (2023) Extremal Fitting Problems for Conjunctive Queries.
    In PODS '23: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems : June 18-23, 2023, Seattle, WA, USA (pp 89-98). Association for Computing Machinery.
  • ten Cate, B., Dalmau, V., Kolaitis, P.G., Wu, W.-L. (2024) When Do Homomorphism Counts Help in Query Algorithms?.
    In Cormode, G. Shekelyan, M. (Eds.), 27th International Conference on Database Theory: ICDT 2024, March 25-28, 2024, Paestum, Italy (Leibniz International Proceedings in Informatics, Vol. 290). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • ten Cate, B., Dalmau, V., Opršal, J. (2024) Right-Adjoints for Datalog Programs.
    In Cormode, G. Shekelyan, M. (Eds.), 27th International Conference on Database Theory: ICDT 2024, March 25-28, 2024, Paestum, Italy (Leibniz International Proceedings in Informatics, Vol. 290). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • ten Cate, B., Dalmau, V. (2021) Conjunctive Queries: Unique Characterizations and Exact Learnability.
    In Yi, K. Wei, Z. (Eds.), 24th International Conference on Database Theory: ICDT 2021, March 23-26, 2021, Nicosia, Cyprus (Leibniz International Proceedings in Informatics, Vol. 186). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • ten Cate, B., Dalmau, V. (2022) Conjunctive Queries: Unique Characterizations and Exact Learnability.
    ACM Transactions on Database Systems, Vol. 47
  • ten Cate, B., Fontaine, G., Litak, T.M. (2007) Some modal aspects of XPath.
    In Proceedings of Methods for Modalities 2007 (pp 21-34)
    Conference contribution | UvA-DARE
  • ten Cate, B., Fontaine, G. (2010) An easy completeness proof for the modal μ-calculus on finite trees.
    In Matthes, R. Uustalu, T. (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009: Coimbra, Portugal, 12-13 September 2009: Proceedings (pp 30-38). Tallinn University of Technology, Institute of Cybernetics.
  • ten Cate, B., Franceschet, M. (2005) On the Complexity of hybrid logics with binders.
    Technical Reports. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • ten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2023) Fitting Algorithms for Conjunctive Queries.
    SIGMOD Record, Vol. 52 (pp 6-18)
  • ten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2023) SAT-Based PAC Learning of Description Logic Concepts.
    In Elkind, E. (Eds.), Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence: IJCAI 2023, Macao, S.A.R, 19-25 August 2023 (pp 3347-3355). International Joint Conferences on Artificial Intelligence.
  • ten Cate, B., Funk, M., Jung, J.C., Lutz, C. (2024) On the non-efficient PAC learnability of conjunctive queries.
    Information Processing Letters, Vol. 183
  • ten Cate, B., Kappé, T. (2025) Algebras for Deterministic Computation Are Inherently Incomplete.
    Proceedings of the ACM on Programming Languages, Vol. 9 (pp 718-744)
  • ten Cate, B., Kolaitis, P.G., Kristjánsson, Arnar Á. (2025) Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts.
    In Gawrychowski, P. Mazowiecki, F. Skrzypczak, M. (Eds.), 50th International Symposium on Mathematical Foundations of Computer Science: MFCS 2025, August 25-29, 2025, Warsaw, Poland (Leibniz International Proceedings in Informatics, Vol. 345). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • ten Cate, B., Kolaitis, P.G., Lutz, C. (2025) Query Repairs.
    In Roy, S. Kara, A. (Eds.), 28th International Conference on Database Theory: ICDT 2025, March 25-28, 2025, Barcelona, Spain (Leibniz International Proceedings in Informatics, Vol. 328). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • ten Cate, B., Koudijs, R., Ozaki, A. (2024) On the Power and Limitations of Examples for Description Logic Concepts (Extended Abstract).
    In Giordano, L. Jung, J.C. Ozaki, A. (Eds.), Proceedings of the 37th International Workshop on Description Logics (DL 2024): Bergen, Norway, June 18-21, 2024 (CEUR Workshop Proceedings, Vol. 3739). CEUR-WS.

The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact