Searchable List of Research Output

Filter Publications
  • Bhargav, S., van Noord, N., Kamps, J. (2019) Deep learning as a tool for early cinema analysis.
    In SUMAC '19: proceedings of the 1st Workshop on Structuring and Understanding of Multimedia Heritage Contents : October 21, 2019, Nice, France (pp 61-68). The Association for Computing Machinery.
  • Biagioli, C., Grossi, D. (2009) Formalizzazione del modello DAO.
    In Biagioli, C. (Eds.), Modelli funzionali delle leggi: Verso testi legislativi autoesplicativi (pp 145-152) (Series in legal information and communication technologies). European Press Academic Publishing.
    Chapter | UvA-DARE
  • Biderman, S., Schoelkopf, H., Anthony, Q., Bradley, H., O'Brien, K., Hallahan, E., Khan, M.A., Purohit, S., Sai Prashanth, U.S., Raff, E., Skowron, A., Sutawika, L., van der Wal, O. (2023) Pythia: A Suite for Analyzing Large Language Models Across Training and Scaling.
    Proceedings of Machine Learning Research, Vol. 202 (pp 2397-2430)
  • Bílková, M., de Jongh, D., Joosten, J.J. (2009) Interpretability in PRA.
    Annals of Pure and Applied Logic, Vol. 161 (pp 128-138)
  • Bílková, M., Palmigiano, A., Venema, Y. (2008) Proof systems for the coalgebraic cover modality.
    In Areces, C. Goldblatt, R. (Eds.), Advances in Modal Logic 7 (pp 1-21). College Publications.
  • Bílková, M., Palmigiano, A., Venema, Y. (2014) Proof systems for Moss’ coalgebraic logic.
    Theoretical Computer Science, Vol. 549 (pp 36-60)
  • Bílková, M., Velebil, J., Venema, Y. (2011) On monotone modalities and adjointness.
    Mathematical Structures in Computer Science, Vol. 21 (pp 383-416)
  • Birmpas, G., Markakis, E., Schäfer, G. (2022) Cost Sharing over Combinatorial Domains.
    ACM Transactions on Economics and Computation, Vol. 10
  • Bisconti, P., McIntyre, A., Russo, F. (2024) Synthetic Socio-Technical Systems: Poiêsis as Meaning Making.
    Philosophy & Technology, Vol. 37
  • Bistarelli, S., Gennari, R., Rossi, F. (2000) Constraint Propagation for Soft Constraint Satisfaction Problems: Generalization and Termination Conditions.
    Lecture Notes in Computer Science, Vol. 1894
    Article | UvA-DARE
  • Bjorndahl, A., Özgün, A. (2017) Logic and Topology for Knowledge, Knowability, and Belief: Extended Abstract.
    Electronic Proceedings in Theoretical Computer Science, Vol. 251 (pp 88-101)
  • Bjorndahl, A., Özgün, A. (2019) Uncertainty about Evidence.
    Electronic Proceedings in Theoretical Computer Science, Vol. 297 (pp 68-81)
  • Bjorndahl, A., Özgün, A. (2020) Logic and topology for knowledge, knowability, and belief.
    Review of Symbolic Logic, Vol. 13 (pp 748-775)
  • Blackburn, P., de Rijke, M., Venema, Y. (1997) Relational methods in logic, language and information.
    In Kahl, W. Brink, C. Schmidt, G. (Eds.), Relational Methods in Computer Science (pp 211-225). Springer-Verlag.
    Chapter | UvA-DARE
  • Blackburn, P., de Rijke, M., Venema, Y. (2001) Modal Logic.
    Cambridge Tracts in Computer Science. Cambridge University Press.
    Book | UvA-DARE
  • Blackburn, P., de Rijke, M. (1997) Specifying Syntactic Structures. Studies in logic, Language and Information.
    CSLI Publications.
    Book (Editorship) | UvA-DARE
  • Blackburn, P., de Rijke, M. (1997) Why combine logics?.
    Studia Logica, Vol. 59 (pp 5-27)
    Article | UvA-DARE
  • Blackburn, P., de Rijke, M. (1997) Zooming in, zooming out.
    Journal of Logic, Language and Information, Vol. 6 (pp 5-31)
    Article | UvA-DARE
  • Blackburn, P., Gaiffe, B., Marx, M. (2003) Variable free reasoning on finite trees.
    In Proceedings of Mathematics of Language (MOL-8)
    Conference contribution | UvA-DARE
  • Blackburn, P., Jaspars, J., de Rijke, M. (1997) Reasoning about changing information.
    South African Computer Journal, Vol. 19 (pp 2-26)
    Article | UvA-DARE

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