Searchable List of Research Output

Filter Publications
  • van Hees, M., Roy, O. (2009) Intentions, decisions and rationality.
    In Boylan, T.A. Gekker, R. (Eds.), Economics, rational choice and normative philosophy (pp 56-72) (Routledge frontiers of political economy). Routledge.
  • van Heijningen, C.A.A., de Visser, J., Zuidema, W., ten Cate, C. (2009) Simple rules can explain discrimination of putative recursive syntactic structures by a songbird species.
    Proceedings of the National Academy of Sciences of the United States of America, Vol. 106 (pp 20538-20534)
  • van Hoeve, W.J., Milano, M. (2003) Decomposition Based Search - A theoretical and experimental evaluation.
    Technical Report. University of Bologna.
    Report | UvA-DARE
  • van Hoeve, W.J., Milano, M. (2004) Postponing Branching Decisions.
    In 16th Conference on Artificial Intelligence (pp 1105-1106). IOS Press.
    Conference contribution | UvA-DARE
  • van Hoeve, W.J., Pesant, G., Rousseau, L.M. (2006) On Global Warming: Flow-Based Soft Global Constraints.
    Journal of Heuristics, Vol. 12 (pp 347-373)
  • van Hoeve, W.J. (2003) A hybrid constraint programming and semidefinite programming approach for the stable set problem.
    In 9th International Conference on Principles and Practice of Constraint Programming (CP'03), volume 2833 of LNCS (pp 407-421). Springer Verlag.
    Conference contribution | UvA-DARE
  • van Hoeve, W.J. (2003) A hybrid constraint programming and semidefinite programming approach for the stable set problem.
    In 5th International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR'03) (pp 3-16)
    Conference contribution | UvA-DARE
  • van Hoeve, W.J. (2004) A Hyper-Arc Consistency Algorithm for the Soft Alldifferent Constraint.
    In Tenth International Conference on Principles and Practice of Constraint Programming (pp 679-689). Springer Verlag.
    Conference contribution | UvA-DARE
  • van Hoeve, W.J. (2005) Operations research techniques in constraint programming.
    ILLC.
    Thesis, fully internal | UvA-DARE
  • van Lambalgen, M., Alechina, N.A. (1995) Correspondence and completeness for generalized quantifiers.
    Bulletin of the IGPL, Vol. 3 (pp 167-190)
    Article | UvA-DARE
  • van Lambalgen, M., Baggio, G. (2007) The Processing Consequences of the Imperfective Paradox.
    Journal of Semantics, Vol. 24 (pp 307-330)
    Article | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2003) Intensionality and coercion.
    In Kahle, R. (Eds.), Intensionality
    Chapter | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2003) Event calculus, nominalisation and the progressive.
    Linguistics and Philosophy, Vol. 26 (pp 381-458)
  • van Lambalgen, M., Hamm, F. (2004) Moschovakis' notion of meaning as applied to linguistics.
    In Baaz, M. Friedman, S. Krajicek, J. (Eds.), Logic Colloquium '01
    Chapter | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2004) The proper treatment of events.
    Explorations in semantics. Blackwell.
    Book | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2004) The Proper Treatment of Events.
    Blackwell.
    Book | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2005) Intensionality and coercion.
    In R. Kahle (Eds.), Intensionality (pp 97-122) (Lecture Notes in Logic). Association for Symbolic Logic.
    Chapter | UvA-DARE
  • van Lambalgen, M., Hamm, F. (2005) Moschovakis' notion of meaning as applied to linguistics.
    In M. Baaz, S-D. Friedman, J. Krajicek (Eds.), Logic Colloquium '01 (pp 255-280). Association for Symbolic Logic.
    Conference contribution | UvA-DARE
  • van Lambalgen, M., Kanovei, V.G. (1995) On a Spector ultrapower of the Solovay model.
    Research report. onbekend (FdL).
    Report | UvA-DARE
  • van Lambalgen, M., Meester, R., Gill, R., Collins, M. (2007) On the (ab)use of statistics in the legal case against the nurse Lucia de B..
    Law, probability and risk, Vol. 5 (pp 233-250)
    Article | UvA-DARE

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