Fokkens, Antske, ter Braake, S., Ockeloen, Niels, Vossen, P.T.J.M., Legene, S., Schreiber, G. (2014) BiographyNet: Methodological issues when NLP supports historical research.

In Calzolari, N. Choukri, K. Declerck, T. Loftsson, H. Maegaard, B. Mariani, J. Moreno, A. Odijk, J. Piperidis, S. (Eds.), Proceedings of the 9th International Conference on Language Resources and Evaluation, LREC 2014: May 26-31, 2014, Reykjavik, Iceland : proceedings (pp 3728-3735). European Language Resources Association (ELRA).

Fontaine, G., Leal, R.A., Venema, Y. (2010) Automata for Coalgebras: an approach using predicate liftings.

In Abramsky, S. Gavoille, C. Kirchner, C. Meyer auf der Heide, F. Spirakis, P.G. (Eds.), Automata, Languages and Programming: 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010 : proceedings (pp 381-392) (Lecture Notes in Computer Science
Advanced Research in Computing and Software Science, Vol. 6199). Springer.

Fontaine, G., Venema, Y. (2018) Some model theory for the modal μ-calculus: Syntactic characterisations of semantic properties.

Logical Methods in Computer Science, Vol. 14

Article | https://doi.org/10.23638/LMCS-14(1:14)2018 | UvA-DARE

Fontaine, G. (2006) ML is not finitely axiomatizable over Cheq.

In Governatori, G. Hodkinson, I. Venema, Y. (Eds.), Advances in Modal Logic 6 (pp 139-146). College Publications.

Fontaine, G. (2008) Continuous Fragment of the mu-Calculus.

In Kaminski, M. Martini, S. (Eds.), Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008 : proceedings (pp 139-153) (Lecture Notes in Computer Science, Vol. 5213). Springer.

Fontaine, G. (2010) Modal fixpoint logic: some model theoretic questions.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Fortnow, L., Rogers, J. (1997) Complexity limitations on quantum computation.

Technical Report. DePaul University School of Computer Science.

Report | UvA-DARE

Fortnow, L. (1997) Counting complexity.

In Selman, L. Hemaspaandra, A. (Eds.), Complexity Theory Retrospective II (pp 81-107). Springer.

Fortnow, L. (1997) Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability.

In Proceedings of the 12th IEEE Conference on Computational Complexity (pp 52-60). IEEE.

Fortuin, E.L.J. (2001) Polysemy or monosemy: Interpretation of the imperative and the dative-infinitive construction in Russian.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Frampton, M., Fernández, R., Ehlen, P., Christoudias, M., Darrell, T., Peters, S. (2009) Who is "you"? Combining linguistic and gaze features to resolve second-person references in dialogue.

In Lascarides, A. Gardent, C. Nivre, J. (Eds.), Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: EACL 2009: 30 March-3 April 2009, Megaron Athens International Conference Centre, Athens, Greece (pp 273-281). Association for Computational Linguistics (ACL).

Franceschet, M., Colavizza, G., Smith, T., Finucane, B., Ostachowski, M.L., Scalet, S., Perkins, J., Morgan, J., Hernández, S. (2021) Crypto Art: A Decentralized View.

Leonardo, Vol. 54 (pp 402-405, 435)

Article | https://doi.org/10.1162/leon_a_02003 | UvA-DARE

Franceschet, M., Colavizza, G. (2020) Quantifying the higher-order influence of scientific publications.

Scientometrics, Vol. 125 (pp 951–963)

Article | https://doi.org/10.1007/s11192-020-03580-9 | UvA-DARE

Franceschet, M., Combi, C., Peron, A. (2002) A logical approach to represent and reason about calendars.

In International Symposium on temporal representation and reasoning (pp 134-140). IEEE Computer Society Press.

Franceschet, M., de Rijke, M., Schlingloff, H. (2003) Hybrid logics on linear structures: expressivity and complexity.

In Proceedings of the International Symposium on temporal representation and reasoning - International Conference on Temporal Logic. IEEE Computer Society Press.

Franceschet, M., de Rijke, M. (2003) Model checking for hybrid logics.

In Proceedings of the Workshop Methods for Modalities (pp 109-124)

Franceschet, M., Montanari, A., de Rijke, M. (2000) Model Checking for combined logics.

In Workshop Proceedings ICTL 2000

Franceschet, M., Montanari, A., de Rijke, M. (2004) Model checking for combined logics with an application to mobile systems.

Automated Software Engineering, Vol. 11 (pp 289-321)

Article | UvA-DARE

Franceschet, M., ten Cate, B. (2004) Guarded fragments with constants.

Technical Reports. Institute for Logic, Language and Computation.

Working paper | UvA-DARE

Franceschet, M. (2004) XPathMark: An XPath benchmark for XMark.

Software | http://www.science.uva.nl/~francesc/xpathmark | UvA-DARE