
Kwisthout, J.H.P., Bodlaender, H.L. & Gaag, L.C. van der (2010). The necessity of bounded treewidth for efficient inference in Bayesian networks. In H. Coelho, R. Studer & M. Wooldridge (Eds.), Proceedings of the 23rd European Conference on Artificial Intelligence, ECAI 2010 (pp. 237-242). Amsterdam: IOS Press. Kwisthout, J.H.P. & Bodlaender, H.L. (2009). Conditional Lower Bounds on the Complexity of Probabilistic Inference. onbekend: UU BETA ICS Departement Informatica. Kwisthout, J.H.P. (2009, October 29). The Computational Complexity of Probabilistic Networks. UU Universiteit Utrecht (169 pag.) ( Utrecht University). Prom./coprom.: prof. dr. J. van Leeuwen, prof. dr. ir. L.C. van der Gaag, dr. H.L. Bodlaender & dr. G. Tel. Kwisthout, J.H.P. & Tel, G. (2008). Complexity Results for Enhanced Qualitative Probabilistic Networks. International Journal of Approximate Reasoning, 48, 879-888. Kwisthout, J.H.P. (2008). Complexity Results for Enumerating MPE and Partial MAP. In M. Jaeger & T. Nielsen (Eds.), Proceedings of the Fourth European Workshop on Probabilistic Graphical Models (PGM'08) (pp. 161-168). Kwisthout, J.H.P., Vogt, P., Dijkstra, A.F.J. & Haselager, W.F.G. (2008). Joint Attention and Language Evolution. Connection science, 20(2-3), 155-171. Kwisthout, J.H.P. & Gaag, L.C. van der (2008). The Computational Complexity of Sensitivity Analysis and Parameter Tuning. In D. McAllester & P. Myllymaki (Eds.), Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI'08) (pp. 349-356). Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity Results for Local Monotonicity in Probabilistic Networks (extended abstract). In M.M. Dastani & E. de Jong (Eds.), Proceedings of the 19th BNAIC, October 17-19, 2007 (pp. 369-370). Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Complexity results for local monotonicity in probabilistic networks. (CS-UU2007-050 ). onbekend: UU WINFI Informatica en Informatiekunde. Kwisthout, J.H.P., Vogt, P., Haselager, P. & Dijkstra, T. (2007). Joint Attention and Language Evolution. (UU-CS2007-039 ). onbekend: UU WINFI Informatica en Informatiekunde. Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2007). Local Monotonicity in Probabilistic Networks. In K. Mellouli & K. Mellouli (Eds.), Procedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQUARU 2007 (pp. 548-559). Springer-Verlag. Kwisthout, J.H.P. (2007). The Computational Complexity of Monotonicity in Probabilistic Networks. In E. Csuhaj-Varj & Z. Esik (Eds.), Sixteenth International Symposium on Fundamentals of Computation Theory, August 27-30, 2007, Budapest, Hungary (pp. 388-399). Springer-Verlag. Kwisthout, J.H.P. (2007). The Computational Complexity of Monotonicity in Probabilistic Networks. (UU-CS2007-040 ). onbekend: UU WINFI Informatica en Informatiekunde. Kwisthout, J.H.P. & Tel, G. (2006). Complexity Results for Enhanced Qualitative Probabilistic Networks. In M. Studeny & J. Vomlel (Eds.), Proceedings of the Third European Workshop on Probabilistic Graphical Models, Prague, Czech Republic, September 12-15, 2006 (pp. 171-178). Action M Agency. Kwisthout, J.H.P. & Tel, G. (2006). Complexity Results for Enhanced Qualitative Probabilistic Networks. (UU-CS2006-058 ). onbekend: UU WINFI Informatica en Informatiekunde. Kwisthout, J.H.P., Bodlaender, H.L. & Tel, G. (2006). Complexity Results for Local Monotonicity in Probabilistic Networks. (uu csUU-CS-2007-050 ). onbekend: UU WINFI Informatica en Informatiekunde. Kwisthout, J.H.P. & Dastani, M.M. (2006). Modelling Uncertainty in Agent Programming. In M. Baldoni, U. Endriss, A. Omicini & P. Torroni (Eds.), Declarative Agent Languages and Technologies III, Third International Workshop, DALT 2005, Utrecht, The Netherlands, July 25, 2005 (pp. 17-32). Springer-Verlag. Kwisthout, J.H.P. & Dastani, M.M. (2005). Modelling Uncertainty in Agent Programming (extended abstract). In . Verbeeck (Ed.), Proceedings of the 17th BNAIC, October 17-19, 2005 (pp. 361-362). KVAB.