Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 55
Number of items: 55
  • Open Access
    Rich, P., Blokpoel, M., de Haan, R., Otworowska, M., Sweers, M., Wareham, T., & van Rooij, I. (2021). Naturalism, tractability and the adaptive toolbox. Synthese, 198(6), 5749–5784. https://doi.org/10.1007/s11229-019-02431-2
  • Open Access
    Botan, S. (2021). Strategyproof social choice for restricted domains. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Dorn, B., de Haan, R., & Schlotter, I. (2021). Obtaining a Proportional Allocation by Deleting Items. Algorithmica, 83(5), 1559–1603. https://doi.org/10.1007/s00453-020-00794-4
  • Open Access
    Woensdregt, M., Spike, M., de Haan, R., Wareham, T., van Rooij, I., & Blokpoel, M. (2021). Why is scaling up models of language evolution hard? In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (Vol. 1, pp. 209-215). (Proceedings of the Annual Meeting of the Cognitive Science Society; Vol. 43). Cognitive Science Society. https://escholarship.org/uc/item/021734q4
  • Open Access
    Rich, P., de Haan, R., Wareham, T., & van Rooij, I. (2021). How hard is cognitive science? In 43rd Annual Meeting of the Cognitive Science Society (CogSci 2021): Comparative Cognition Animal Minds : Vienna, Austria, 26-29 July 2021 (Vol. 5, pp. 3034-3040). (Proceedings of the Annual Meeting of the Cognitive Science Society; Vol. 43). Cognitive Science Society. https://escholarship.org/uc/item/8cr8x1c4
  • Open Access
    de Haan, R., & van de Pol, I. (2021). On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. Journal of Applied Logics - IfCoLog Journal of Logics and their Applications, 8(3), 621-658. https://doi.org/10.48550/arXiv.1805.09880
  • Ganian, R., de Haan, R., Kanj, I., & Szeider, S. (2020). On Existential MSO and its Relation to ETH. ACM Transactions on Computation Theory, 12(4), Article 22. https://doi.org/10.1145/3417759
  • Open Access
    Rey, S., Endriss, U., & de Haan, R. (2020). Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), KR2020 : Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning: Rhodes, Greece, September 12-18, 2020 (pp. 692-702). IJCAI. https://doi.org/10.24963/kr.2020/71
  • Open Access
    Endriss, U., de Haan, R., Lang, J., & Slavkovik, M. (2020). The Complexity Landscape of Outcome Determination in Judgment Aggregation. Journal of Artificial Intelligence Research, 69, 687–731. https://doi.org/10.1613/jair.1.11970
  • Open Access
    Aziz, H., Biró, P., Gaspers, S., de Haan, R., Mattei, N., & Rastegari, B. (2020). Stable Matching with Uncertain Linear Preferences. Algorithmica, 82(5), 1410–1433. https://doi.org/10.1007/s00453-019-00650-0
Page 3 of 6