-
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.Conference contribution | http://www.aamas-conference.org/Proceedings/aamas2017/pdfs/p952.pdf | UvA-DAREde 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.Conference contribution | https://doi.org/10.24963/ijcai.2019/231 | UvA-DAREde Haan, R., Szeider, S. (2017) Parameterized Complexity Classes Beyond para-NP.Journal of Computer and System Sciences, Vol. 87 (pp 16-57)Article | https://doi.org/10.1016/j.jcss.2017.02.002 | UvA-DAREde Haan, R., Szeider, S. (2019) A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy.Algorithms, Vol. 12Article | https://doi.org/10.3390/a12090188 | UvA-DAREde 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.Conference contribution | https://doi.org/10.1007/978-3-662-47709-0_6 | UvA-DAREde Haan, R., Szymanik, J. (2019) Characterizing polynomial Ramsey quantifiers.Mathematical Structures in Computer Science, Vol. 29 (pp 896-908)Article | https://doi.org/10.1017/S0960129518000397 | UvA-DAREde 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 ApplicationsArticle | https://doi.org/10.48550/arXiv.1805.09880 | UvA-DAREde 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.Conference contribution | https://doi.org/10.4230/LIPIcs.FUN.2018.17 | UvA-DAREde 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.Conference contribution | http://www.aamas-conference.org/Proceedings/aamas2017/pdfs/p1151.pdf | UvA-DAREde 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-DAREde 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-DAREde 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)Article | https://doi.org/10.1080/21507740.2014.951788 | UvA-DAREde 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. 12Article | https://doi.org/10.1371/journal.pone.0175748 | UvA-DAREde 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. 7Article | https://doi.org/10.3389/fnhum.2013.00653 | UvA-DAREde 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. 10Article | https://doi.org/10.1371/journal.pone.0135524 | UvA-DAREde Haas, E., Adriaans, P.W. (2000) Grammar induction as substructural inductive logic programming.Lecture Notes in Computer Science, Vol. 1925 (pp 127-142)Article | UvA-DAREde Haas, E., Adriaans, P.W. (2000) Learning from a substructural perspective.In Proceedings of the fourth Conference on Computational Natural Language Learning and of the Second Language Learning in Logic Workshop (pp 176-183)Conference contribution | UvA-DAREde Haas, E. (2001) Logics for OO information systems: a semantic study of object orientation from a categorial substructural perspective.Thesis, fully internal | UvA-DAREde Haas, W.B., Burgoyne, J.A. (2012) Parsing the Billboard Chord Transcriptions.UU-CS. Utrecht University.Working paper | 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