-
Ciardelli, I.A., Roelofsen, F. (2015) Inquisitive dynamic epistemic logic.Synthese, Vol. 192 (pp 1643-1687)Article | https://doi.org/10.1007/s11229-014-0404-7 | UvA-DARE
-
Ciardelli, I.A. (2010) A first-order inquisitive semantics.In Aloni, M. Bastiaanse, H. de Jager, T. Schulz, K. (Eds.), Logic, Language and Meaning: 17th Amsterdam Colloquium : Amsterdam, The Netherlands, December 16-18, 2009 : revised selected papers (pp 234-243) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence
FoLLI Publications on Logic, Language and Information, Vol. 6042). Springer.Conference contribution | https://doi.org/10.1007/978-3-642-14287-1_24 | UvA-DARECiardelli, I.A. (2016) Questions in logic.Thesis, fully internal | UvA-DARECilibrasi, R., de Wolf, R., Vitanyi, P.M.B. (2004) Algorithmic Clustering of Music.In Proceedings of IEEE 4th International Conference on Web Delivering of Music (pp 110-117). IEEE Computer Soc. Press.Conference contribution | UvA-DARECilibrasi, R., Lotker, Z., Navarra, A., Perennes, S., Vitanyi, P.M.B. (2006) About the lifespan of peer to peer networks.Lecture Notes in Computer Science, Vol. 4305 (pp 290-305)Article | UvA-DARECilibrasi, R., van Iersel, E.J.J., Kelk, S., Tromp, J. (2007) On the complexity of the Single Individual SNP Haplotyping Problem.Algorithmica, Vol. 49 (pp 13-36)Article | https://doi.org/10.1007/s00453-007-0029-z | UvA-DARECilibrasi, R., Vitanyi, P.M.B., de Wolf, R. (2003) Algorithm Clustering of Music.ERCIM News, Vol. 54 (pp 53-53)Article | UvA-DARECilibrasi, R., Vitanyi, P.M.B., de Wolf, R. (2004) Algorithmic clustering of music based on string compression.Computer Music Journal, Vol. 28 (pp 49-67)Article | UvA-DARECilibrasi, R., Vitanyi, P.M.B. (2005) Google Teaches Computer the Meaning of Words.ERCIM News, Vol. 61 (pp 48-49)Article | UvA-DARECilibrasi, R., Vitanyi, P.M.B. (2005) Clustering by compression.IEEE Transactions on Information Theory, Vol. 51 (pp 1523-1545)Article | https://doi.org/10.1109/TIT.2005.844059 | UvA-DARECilibrasi, R., Vitanyi, P.M.B. (2006) Automatic extraction of meaning from the web.In Proceedings IEEE International symposium on information theory (pp 2309-2313)Conference contribution | UvA-DARECilibrasi, R., Vitanyi, P.M.B. (2006) Similarity of objects and the meaning of words.Lecture Notes in Computer Science, Vol. 3959 (pp 21-45)Article | UvA-DARECilibrasi, R., Vitanyi, P.M.B. (2014) A Fast Quartet Tree Heuristic for Hierarchical Clustering.ArXiv.Preprint | https://doi.org/10.48550/arXiv.1409.4276 | UvA-DARECilibrasi, R.L., Vitányi, P.M.B. (2011) A Fast Quartet tree heuristic for hierarchical clustering.Pattern Recognition, Vol. 44 (pp 662-677)Article | https://doi.org/10.1016/j.patcog.2010.08.033 | UvA-DARECilibrasi, R.L. (2007) Statistical inference through data compression.Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DARECina, G., Baltag, A. (2016) Bisimulation for conditional modalities (extended version).In ILLC Technical ReportsConference contribution | UvA-DARECina, G., Endriss, U. (2015) A Syntactic Proof of Arrow's Theorem in a Modal Logic of Social Choice Functions.In AAMAS '15: proceedings of the 2015 International Conference on Autonomous Agents & Multiagent Systems : May, 4-8, 2015, Istanbul, Turkey (pp 1009-1017). International Foundation for Autonomous Agents and Multiagent Systems.Conference contribution | http://www.aamas-conference.org/Proceedings/aamas2015/aamas/p1009.pdf | UvA-DARECina, G., Endriss, U. (2016) Proving Classical Theorems of Social Choice Theory in Modal Logic.Autonomous Agents and Multi-Agent Systems, Vol. 30 (pp 963-989)Article | https://doi.org/10.1007/s10458-016-9328-6 | UvA-DARECina, G., Enqvist, N.J.S. (2015) Bisimulation and path logic for sheaves.In Proceedings of TACL 2015Conference contribution | UvA-DARECina, G., Enqvist, N.J.S. (2016) Bisimulation and path logic for sheaves: contextuality and beyond..In ILLC Technical ReportsConference contribution | UvA-DAREThe 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 illc at uva.nl