Tsarfaty, R. (2007) Participants in Action: The Interplay of Aspectual Meanings and Thematic Relations in the Semantics of Semitic Morphology.

In ten Cate, B.D. Zeevat, H.W. (Eds.), Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005 : revised selected papers (pp 200-215) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence, Vol. 4363). Springer.

Tsarfaty, R. (2010) Relational-realizational parsing.

ILLC.

Thesis, fully internal | UvA-DARE

Tsur, O., de Rijke, M., Sima'an, K. (2004) BioGrapher: Biography Questions as a Restricted Domain Question Answering Task.

In Mollá, D. Vicedo, J.L. (Eds.), Question Answering in Restricted Domains: proceedings of the ACL 2004 workshop: 26 July 2004, Barcelona, Spain (pp 23-30). Association for Computational Linguistics.

Tulenheimo, T., Venema, Y. (2008) Propositional logics for three.

In Dégrémont, C. Keiff, L. Rückert, H. (Eds.), Dialogues, logics and other strange things: Essays in honour of Shahid Rahman (pp 399-430) (Tributes). College Publications.

Tur, G., Stolcke, A., Voss, L., Peters, S., Hakkani-Tür, D., Dowding, J., Favre, B., Fernández, R., Frampton, M., Frandsen, M., Frederickson, C., Graciarena, M., Kintzing, D., Leveque, K., Mason, S., Niekrasz, J., Purver, M., Riedhammer, K., Shriberg, E., Tien, J., Vergyri, D., Yang, F. (2010) The CALO Meeting Assistant system.

IEEE Transactions on Audio, Speech and Language Processing, Vol. 18 (pp 1601-1611)

Article | https://doi.org/10.1109/TASL.2009.2038810 | UvA-DARE

Turrini, P., Grossi, D., Broersen, J., Meyer, J.-J.C. (2010) Forbidding undesirable agreements: a dependence-based approach to the regulation of multi-agent systems.

In Governatori, G. Sartor, G. (Eds.), Deontic Logic in Computer Science: 10th international conference, DEON 2010, Fiesole, Italy, July 7-9, 2010 : proceedings (pp 306-322) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence, Vol. 6181). Springer.

Tzanis, E. (2003) Collatz Conjecture: Properties and Algorithms.

In Proceedings of the 9th Panhellenic Conference & 1 st Balcanic Conference in Informatics (pp 700-713)

Tzanis, E. (2005) A quantum algorithm for string matching.

In Proceedings of IADIS 2005. IADIS.

Uckelman, J., Chevaleyre, Y., Endriss, U., Lang, J. (2009) Representing utility functions via weighted goals.

Mathematical Logic Quarterly, Vol. 55 (pp 341-361)

Article | https://doi.org/10.1002/malq.200810024 | UvA-DARE

Uckelman, J., Endriss, U. (2008) Preference modeling by weighted goals with max aggregation.

In Brewka, G. Lang, J. (Eds.), Principles of knowledge representation and reasoning: Proceedings of the eleventh international conference (KR 2008) (pp 579-587). AAAI Press.

Uckelman, J., Endriss, U. (2008) Winner determination in combinatorial auctions with logic-based bidding languages.

In Padgham, L. Parkes, D. Müller, J. Parsons, S. (Eds.), AAMAS 2008: 7th International Conference on Autonomous Agents and Multi-Agent Systems: Proceedings: Volume 3 (pp 1617-1620). International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).

Uckelman, J., Endriss, U. (2010) Compactly representing utility functions using weighted goals and the max aggregator.

Artificial Intelligence, Vol. 174 (pp 1222-1246)

Article | https://doi.org/10.1016/j.artint.2010.07.003 | UvA-DARE

Uckelman, J., Witzel, A. (2008) Logic-based preference languages with intermediate complexity.

In Advances in preference handling: Papers from the AAAI workshop (pp 123-127). AAAI Press.

Uckelman, J. (2010) Alice and Bob will fight: the problem of electing a committee in the presence of candidate interdependence.

Frontiers in Artificial Intelligence and Applications, Vol. 215 (pp 1023-1024)

Article | https://doi.org/10.3233/978-1-60750-606-5-1023 | UvA-DARE

Uckelman, J. (2010) Alice and Bob Will Fight: The Problem of Electing a Committee in the Presence of Candidate Interdependence.

In Lang, J. Perny, P. (Eds.), Proceedings of the 5th Multidisciplinary Workshop on Advances in Preference Handling (MPREF-2010) (pp 73-78)

Uckelman, J.D., Endriss, U. (2007) Preference Representation with Weighted Goals: Expressivity, Succinctness, Complexity.

In Junker, U. Doyle, J., Goldsmith, J. (Eds.), Proceedings of the AAAI Workshop on Preference Handling for Artificial Intelligence (AiPref-2007)

Uckelman, J.D. (2009) More than the sum of its parts : compact preference representation over combinatorial domains.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Uckelman, S.L., Johnston, S. (2010) John Buridan's Sophismata and interval temporal semantics.

Philosophiegeschichte und logische Analyse, Vol. 13 (pp 133-147)

Article | http://staff.science.uva.nl/~suckelma/latex/buridaninterval/buridaninterval-lahp.pdf | UvA-DARE

Uckelman, S.L., Johnston, S. (2010) A simple semantics for Aristotelian apodeictic syllogistics.

In Beklemishev, L. Goranko, V. Shehtman, V. (Eds.), Advances in Modal Logic: AiML 8 (pp 454-469). College Publications.

Uckelman, S.L., Maat, J., Rybalko, K. (2018) The Art of Doubting in Obligationes Parisienses.

In Kann, C. Loewe, B. Rode, C. Uckelman, S.L. (Eds.), Modern views of medieval logic (pp 11-27) (Recherches de theologie et philosophie medievales. Bibliotheca, Vol. 16). Peeters.