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

Article | https://doi.org/10.1145/3559756 | UvA-DARE

ten Cate, B., Fontaine, G., Litak, T.M. (2007) Some modal aspects of XPath.

In Proceedings of Methods for Modalities 2007 (pp 21-34)

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)

Article | https://doi.org/10.1145/3641832.3641834 | UvA-DARE

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

Article | https://doi.org/10.1016/j.ipl.2023.106431 | UvA-DARE

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)

Article | https://doi.org/10.1145/3704861 | UvA-DARE

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.

ten Cate, B., Koudijs, R., Ozaki, A. (2024) On the Power and Limitations of Examples for Description Logic Concepts.

In Larson, K. (Eds.), Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence: Jeju, Korea : 3-9 August 2024 (pp 3567-3575) (IJCAI, Vol. 5). International Joint Conferences on Artificial Intelligence.

ten Cate, B., Koudijs, R. (2022) Characterising Modal Formulas with Examples.

Paper | https://doi.org/10.48550/arXiv.2206.06049 | UvA-DARE

ten Cate, B., Koudijs, R. (2024) Characterising Modal Formulas with Examples.

ACM Transactions on Computational Logic, Vol. 25

Article | https://doi.org/10.1145/3649461 | UvA-DARE

ten Cate, B., Marx, M., Viana, J.P. (2004) Sahlqvist theory for hybrid logic.

In Troelstra, A. (Eds.), Liber Amicorum ter gelegenheid van het afscheid van Dick de Jongh (pp 1-6)

ten Cate, B., Safarova, M. (2001) Interpreting uncertain or inconsistent information using belief networks.

In O'Donoghue, D. (Eds.), Proceedings of The 12th Irish Conference on Artificial Intelligence and Cognitive Science, Maynooth, Co. Kildare, Ireland, September 2001 (pp 243-252). National University of Ireland.

ten Cate, B., Safarova, M. (2001) Representing model conversation failures with belief networks.

In Schreiber, G. Kröse, B. de Rijke, M. van Someren, M. (Eds.), Proceedings of BNAIC 2001, Amsterdam, October 25-26 2001 (pp 365-372)

ten Cate, B., Shan, C. (2002) Question answering: From partitions to prolog.

In Egli, U. Fermuller, C. (Eds.), Proceedings of TABLEAUX 2002: Automated Reasoning with Analytic Tableaux and Related Methods (pp 251-265). Springer Verlag.