Searchable List of Research Output

Filter Publications
  • Apt, K.R. Simon, S. (2013) Social Network Games with Obligatory Product Selection.
    Electronic Proceedings in Theoretical Computer Science, Vol. 119 (pp 180-193)
  • Apt, K.R. Smaus, J. (2001) ``Rule-based versus Procedure-based View of Programming''.
    Joint Bulletin of the Novosibirsk Computing Center and Institute of Information Systems, Vol. 16 (pp 75-97)
    Article | UvA-DARE
  • Apt, K.R. Teusink, F. (1995) Comparing negation in logic programming and in Prolog.
    In Turini, F. Apt, K.R. (Eds.), Meta-logics and Logic Programming (pp 111-133). The MIT Press.
    Chapter | UvA-DARE
  • Apt, K.R. Turini, F. (1995) Meta-logics and Logic Programming.
    The MIT Press.
    Book (Editorship) | UvA-DARE
  • Apt, K.R. van Emde Boas, P. Welling, A. (1995) The STO problem is NP-Hard.
    Journal of Symbolic Computation, Vol. 18 (pp 489-495)
  • Apt, K.R. van Rooij, R. (2008) New Perspectives on Games and Interaction.
    Texts in logic and games, Vol. 4. Amsterdam University Press.
    Book (Editorship) | UvA-DARE
  • Apt, K.R. Vermeulen, C.F.M. (2002) First-order logic as a constraint programming language.
    Lecture Notes in Computer Science, Vol. 2514 (pp 19-35)
  • Apt, K.R. Wallace, M.G. (2006) Constraint Logic Programming using ECLiPSe.
    Cambridge University Press.
    Book | UvA-DARE
  • Apt, K.R. Witzel, A. Zvesper, J.A. (2009) Common knowledge in interaction structures.
    In 12th Conference on Theoretical Aspects of Rationality and Knowledge: TARK '09 : California, July 06-08, 2009 (pp 4-13). ACM.
  • Apt, K.R. Witzel, A. (2009) A generic approach to coalition formation.
    International Game Theory Review, Vol. 11 (pp 347-367)
  • Apt, K.R. Witzel, S.A. (2007) A Generic Approach to Coalition Formation.
    Institute for Logic Language and Computation.
  • Apt, K.R. Wojtczak, D. (2019) Open Problems in a Logic of Gossips.
    Electronic Proceedings in Theoretical Computer Science, Vol. 297 (pp 1-18)
  • Apt, K.R. Zoeteweij, P. (2003) A comparative study of arithmetic constraints on integer intervals.
    In Proceedings of the 2003 ERCIM/Colognet Workshop on Constraints. MTA SZTAKI.
    Conference contribution | UvA-DARE
  • Apt, K.R. Zoeteweij, P. (2004) A Comparative Study of Arithmetic Constraints on Integer Intervals.
    In Apt, K.R. Fages, F. Rossi, F. Szeredi, P. Váncza, J. (Eds.), Recent Advances in Constraints: Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2003, Budapest, Hungary, June 30-July 2, 2003 : selected papers (pp 1-24) (Lecture notes in computer science
    Lecture Notes in Artificial Intelligence, Vol. 3010). Springer.
  • Apt, K.R. Zoeteweij, P. (2007) An Analysis of Arithmetic Constraints on Integer Intervals.
    Constraints, Vol. 12 (pp 429-468)
  • Apt, K.R. Zvesper, J.A. (2010) The role of monotonicity in the epistemic analysis of strategic games.
    Games, Vol. 1 (pp 381-394)
  • Apt, K.R. (1995) Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming.
    In Sessa, M.I. Alpuente Frasnedo, M. (Eds.), 1995 Joint Conference on Declarative Programming (GULP-PRODE '95) (pp 19-35). University of Salerno, Italy.
    Chapter | UvA-DARE
  • Apt, K.R. (1998) Formulas as programs.
    PNA. WINS (oud WINS).
    Report | UvA-DARE
  • Apt, K.R. (1998) Alma-O: An Imperative Language that supports declarative programming.
    ACM Transactions on Programming Languages and Systems, Vol. 20 (pp 1014-1066)
    Article | UvA-DARE
  • Apt, K.R. (1998) Special Issue: foundations of constraint programming.
    Fundamenta Informaticae, Vol. 34 (pp ---)
    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