uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter 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
  • 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
  • Blackburn, P., Kamps, J., Marx, M. (2001) Situation calculus as hybrid logic: First steps.
    Technical Report. Institute for Logic, Language and Computation.
    Working paper | UvA-DARE
  • Blackburn, P., Kamps, J., Marx, M. (2001) Situation calculus as hybrid logic: First steps.
    In Brazdil, P. Jorge, A. (Eds.), Progress in Artificial Intelligence (pp 253-260) (Lecture Notes in Artificial Intelligence). Springer Verlag.
    Chapter | UvA-DARE
  • Blackburn, P., Marx, M. (2001) Tableaux for quantified hybrid logic.
    In Areces, C. de Rijke, M. (Eds.), Proceedings of M4M Workshop, 2001
    Conference contribution | UvA-DARE
  • Blackburn, P., Marx, M. (2001) Quantified hybrid logic and natural language.
    In Proceedings Amsterdam Colloquium 2001
    Conference contribution | UvA-DARE
  • Blackburn, P., Marx, M. (2001) Third international workshop on hybrid logic (hylo'01).
    Logic Journal of the IGPL, Vol. 9 (pp 735-737)
    Article | UvA-DARE
  • Blackburn, P., Marx, M. (2002) Tableaux for quantified hybrid logic.
    Lecture Notes in Computer Science, Vol. 2381 (pp 38-52)
    Article | UvA-DARE
1 ... 41 42 43 44 45 46 47 48 49 ... 311

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