Searchable List of Research Output

Filter Publications
  • Zambella, D. (1994). Chapters on bounded arithmetic & on provability logic. >>>
  • Zambella, D. (1995). Algebraic methods and bounded formulas. (Research report ftp site). onbekend (FdL). >>>
  • Zambella, D. (1995). End extensions of models of linearly bounded arithmetic. (Research report ftp site). onbekend (FdL). >>>
  • Zambella, D. (1995). Notes on polynomially bounded arithmetic. (Research report ftp site). onbekend (FdL). >>>
  • Zambella, D. (1996). Notes on polynomially bounded arithmetic. Journal of Symbolic Logic, 61, 942-966. >>>
  • Zambella, D. (1997). Algebraic methods and bounded formulas. Notre Dame Journal of Formal Logic, 38, 37-48. >>>
  • Zambella, D. (1997). Forcing in finite structures. Mathematical Logic Quarterly, 43, 401-412. >>>
  • Zambella, D. (1998). Foundation versus induction in Kripke-Platek set theory. Journal of Symbolic Logic, 63(4), 1399-1403. >>>
  • Zambella, D. (2001). Computational randomness and lowness. Journal of Symbolic Logic, 66(3), 1199-1205. >>>
  • Zamborlini, V., Betti, A., & van den Heuvel, C. (2017). Toward a Core Conceptual Model for (Im)material Cultural Heritage in the Golden Agents project: Storyfying data. In A. Fensel, & L. Daniele (Eds.), SEMANTiCS-WS 2017 : Workshops of SEMANTiCS 2017: Joint Proceedings of SEMANTiCS 2017 Workshops, co-located with the 13th International Conference on Semantic Systems (SEMANTiCS 2017) : Amsterdam, Netherlands, September 11 and 14, 2017 (CEUR Workshop Proceedings; Vol. 2063). CEUR-WS. >>>
  • Zarrieß, S., Hough, J., Kennington, C., Manuvinakurike, R., DeVault, D., Fernández, R., & Schlangen, D. (2016). PentoRef: A Corpus of Spoken References in Task-oriented Dialogues. In N. Calzolari, K. Choukri, T. Declerck, S. Goggi, M. Grobelnik, B. Maegaard, J. Mariani, H. Mazo, A. Moreno, J. Odijk, & S. Piperidis (Eds.), LREC 2016 : Tenth International Conference on Language Resources and Evaluation: May 23-28, 2016, Grand Hotel Bernardin Conference Center, Portorož, Slovenia (pp. 125-131). European Language Resources Association (ELRA). >>>
  • Zeevat, H., & Schmitz, H-C. (2015). Bayesian Natural Language Semantics and Pragmatics. (Language, Cognition, and Mind; Vol. 2). Springer. >>>
  • Zeevat, H. (2008). Where is pragmatics in optimality theory? In I. Kecskes, & J. Mey (Eds.), Intention, common ground and the egocentric speaker-hearer (pp. 87-104). (Mouton series in pragmatics; No. 4). Mouton de Gruyter. >>>
  • Zeevat, H. (2008). Constructive optimality theoretic syntax. In J. Villadsen, & H. Christiansen (Eds.), Proceedings of the 5th International Workshop on Constraints and Language Processing (CSLP 2008) (pp. 76-88). Roskilde University, Computer Science. >>>
  • Zeevat, H. (2009). "Only" as a mirative particle. Sprache und Datenverarbeitung, 33, 179-196. >>>
  • Zeevat, H. (2009). Optimal interpretation as an alternative to Gricean pragmatics. Oslo Studies in Language, 1(1), 191-216. >>>
  • Zeevat, H. (2010). The production and interpretation of anaphora and ellipsis. International Review of Pragmatics, 2(2), 169-190. >>>
  • Zeevat, H. (2011). Bayesian interpretation and Optimality Theory. In A. Benz, & J. Mattausch (Eds.), Bidirectional Optimality Theory (pp. 191-219). (Linguistik Aktuell/Linguistics Today; Vol. 180). John Benjamins Publishing Company. >>>
  • Zeevat, H. (2011). Bayesian NL interpretation and learning. In N. Bezhanishvili, S. Löbner, K. Schwabe, & L. Spada (Eds.), Logic, Language, and Computation: 8th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2009, Bakuriani, Georgia, September 21-25 2009 : revised selected papers (pp. 342-359). (Lecture Notes in Computer Science; Vol. 6618), (Lecture Notes in Artificial Intelligence), (FoLLI Publications on Logic, Language and Information). Springer. >>>
  • Zeevat, H. (2012). Objection Marking and Additivity. Lingua, 122(15), 1886-1898. >>>

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