Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 74
Number of items: 74
  • Open Access
    ten Cate, B., & Kappé, T. (2025). Algebras for Deterministic Computation Are Inherently Incomplete. Proceedings of the ACM on Programming Languages, 9(POPL), 718-744. Article 25. https://doi.org/10.1145/3704861
  • Open Access
    ten Cate, B., & Comer, J. (2025). Craig Interpolation for Decidable First-Order Fragments. Logical Methods in Computer Science, 21(3), Article 22. https://doi.org/10.46298/lmcs-21(3:22)2025
  • Open Access
    Soeteman, A., & ten Cate, B. (2025). Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization. In D. Belgrave, C. Zhang, H. Lin, R. Pascanu, P. Koniusz, M. Ghassemi, & N. Chen (Eds.), 39th Annual Conference on Neural Information Processing Systems (NeurIPS 2025): 2-7 December 2025, San Diego, California, USA and 30 November-5 December 2025, Mexico City, Mexico (pp. 106978-107013). (Advances in Neural Information Processing Systems; Vol. 38). Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-3226
  • Open Access
    ten Cate, B., Kolaitis, P. G., & Lutz, C. (2025). Query Repairs. In S. Roy, & A. Kara (Eds.), 28th International Conference on Database Theory: ICDT 2025, March 25-28, 2025, Barcelona, Spain Article 15 (Leibniz International Proceedings in Informatics; Vol. 328). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2025.15, https://doi.org/10.48550/arXiv.2501.11162
  • Open Access
    Koudijs, R. S. (2025). Learning logical concepts. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    ten Cate, B., Kolaitis, P. G., & Kristjánsson, A. Á. (2025). Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts. In P. Gawrychowski, F. Mazowiecki, & M. Skrzypczak (Eds.), 50th International Symposium on Mathematical Foundations of Computer Science: MFCS 2025, August 25-29, 2025, Warsaw, Poland Article 34 (Leibniz International Proceedings in Informatics; Vol. 345). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.34, https://doi.org/10.48550/arXiv.2504.16567
  • Open Access
    Bogaerts, B., ten Cate, B., McLean, B., & Van den Bussche, J. (2024). Preservation theorems for Tarski's relation algebra. Logical Methods in Computer Science, 20(3), Article 20. https://doi.org/10.46298/lmcs-20(3:20)2024, https://doi.org/10.48550/arXiv.2305.04656
  • Open Access
    ten Cate, B., Koudijs, R., & Ozaki, A. (2024). On the Power and Limitations of Examples for Description Logic Concepts (Extended Abstract). In L. Giordano, J. C. Jung, & A. Ozaki (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. https://ceur-ws.org/Vol-3739/abstract-9.pdf
  • Open Access
    ten Cate, B., & Koudijs, R. (2024). Characterising Modal Formulas with Examples. ACM Transactions on Computational Logic, 25(2), Article 12. https://doi.org/10.1145/3649461
  • Open Access
    ten Cate, B., Dalmau, V., & Opršal, J. (2024). Right-Adjoints for Datalog Programs. In G. Cormode, & M. Shekelyan (Eds.), 27th International Conference on Database Theory: ICDT 2024, March 25-28, 2024, Paestum, Italy Article 10 (Leibniz International Proceedings in Informatics; Vol. 290). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2024.10
Page 1 of 8