uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • De Cao, N., Schmid, L., Hupkes, D., Titov, I. (2022) Sparse Interventions in Language Models with Differentiable Masking.
    In Bastings, J. Belinkov, Y. Elazar, Y. Hupkes, D. Saphra, N. Wiegreffe, S. (Eds.), BlackboxNLP Analyzing and Interpreting Neural Networks for NLP: BlackboxNLP 2022 : Proceedings of the Workshop : December 8, 2022 (pp 16-27). Association for Computational Linguistics.
  • De Cao, N. (2024) Entity centric neural models for natural language processing.
    ILLC Dissertation Series
    Thesis, fully internal | UvA-DARE
  • de Graaf, M.G., de Wolf, R. (2002) On quantum versions of the yao principle.
    Lecture Notes in Computer Science, Vol. 2285 (pp 247-358)
    Article | UvA-DARE
  • de Haan, R., Kanj, I., Szeider, S. (2017) On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.
    ACM Transactions on Computational Logic, Vol. 18
  • de Haan, R., Slavkovik, M. (2017) Complexity Results for Aggregating Judgments using Scoring or Distance-Based Procedures.
    In Das, S. Durfee, E. Larson, K. Winikoff, M. (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (pp 952-961). International Foundation for Autonomous Agents and Multiagent Systems.
  • de Haan, R., Slavkovik, M. (2019) Answer Set Programming for Judgment Aggregation.
    In Kraus, S. (Eds.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence: IJCAI-19 : Macao, 10-16 August 2019 (pp 1668-1674). International Joint Conferences on Artificial Intelligence.
  • de Haan, R., Szeider, S. (2017) Parameterized Complexity Classes Beyond para-NP.
    Journal of Computer and System Sciences, Vol. 87 (pp 16-57)
  • de Haan, R., Szeider, S. (2019) A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.
    Algorithms, Vol. 12
  • de Haan, R., Szymanik, J. (2015) A dichotomy result for Ramsey quantifiers.
    In de Paiva, V. de Queiroz, R. Moss, L.S. Leivant, D. de Oliveira, A.G. (Eds.), Logic, Language, Information, and Computation: 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015 : proceedings (pp 69-80) (Lecture Notes in Computer Science
    FoLLI Publications on Logic, Language and Information, Vol. 9160). Springer.
  • de Haan, R., Szymanik, J. (2019) Characterizing polynomial Ramsey quantifiers.
    Mathematical Structures in Computer Science, Vol. 29 (pp 896-908)
  • de Haan, R., van de Pol, I. (2020) On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models.
    IfCoLoG Journal of Logics and their Applications
  • de Haan, R., Wolf, P. (2018) Restricted Power - Computational Complexity Results for Strategic Defense Games.
    In Ito, H. Leonardi, S. Pagli, L. Prencipe, G. (Eds.), 9th International Conference on Fun with Algorithms: FUN 2018, June 13-15, 2016, La Maddalena Island, Italy (Leibniz International Proceedings in Informatics, Vol. 100). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
  • de Haan, R. (2017) Complexity Results for Manipulation, Bribery and Control of the Kemeny Judgment Aggregation Procedure.
    In Das, S. Durfee, E. Larson, K. Winikoff, M. (Eds.), AAMAS '17: proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems : May, 8-12, 2017, São Paulo, Brazil (pp 1151-1159). International Foundation for Autonomous Agents and Multiagent Systems.
  • de Haan, R. (2018) Hunting for Tractable Languages for Judgment Aggregation.
    In Thielscher, M. Toni, F. Wolter, F. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018): Tempe, Arizona, 30 October-2 November 2018 (pp 194-203). AAAI Press.
    Conference contribution | https://arxiv.org/abs/1808.03043 | UvA-DARE
  • de Haan, R. (2018) A Parameterized Complexity View on Description Logic Reasoning.
    In Thielscher, M. Toni, F. Wolter, F. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR2018): Tempe, Arizona, 30 October-2 November 2018 (pp 359-368). AAAI Press.
    Conference contribution | https://arxiv.org/abs/1808.03852 | UvA-DARE
  • de Haan, R. (2019) Parameterized Complexity in the Polynomial Hierarchy: Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy.
    Lecture Notes in Computer Science
    FoLLI Publications on Logic, Language and Information, Vol. 11880. Springer.
  • de Haan, S., Rietveld, E., Denys, D. (2014) Stimulating good practice: what an EEC approach could actually mean for DBS practice.
    AJOB Neuroscience, Vol. 5 (pp 46-48)
  • de Haan, S., Rietveld, E., Denys, D. (2017) Becoming more oneself? Changes in personality following DBS treatment in psychiatric disorders: Experiences of OCD patients and general considerations.
    PLoS ONE, Vol. 12
  • de Haan, S., Rietveld, E., Stokhof, M., Denys, D. (2013) The phenomenology of deep brain stimulation-induced changes in OCD: An enactive affordance-based model.
    Frontiers in Human Neuroscience, Vol. 7
  • de Haan, S., Rietveld, E., Stokhof, M., Denys, D. (2015) Effects of Deep Brain Stimulation on the lived experience of Obsessive-Compulsive Disorder patients: In-depth interviews with 18 patients.
    PLoS ONE, Vol. 10
1 ... 84 85 86 87 88 89 90 91 92 ... 311

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