Searchable List of Research Output

Filter Publications
  • Apt, K.R., Rossi, F., Venable, K.B. (2005) CP-nets and Nash equilibria.
    In Proceedings of CIRAS '05 (pp 1-6). Elsevier.
    Conference contribution | UvA-DARE
  • Apt, K.R., Rossi, F., Venable, K.B. (2008) A comparison of the notions of optimality in soft constraints and graphical games.
    In Fages, F. Rossi, F. Soliman, S. (Eds.), Recent Advances in Constraints: 12th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2007 Rocquencourt, France, June 7-8, 2007 : revised selected papers (pp 1-16) (Lecture Notes in Computer Science, Vol. 5129). Springer.
  • Apt, K.R., Rossi, F., Venable, K.B. (2008) Comparing the notions of optimality in CP-nets, strategic games and soft constraints.
    Annals of Mathematics and Artificial Intelligence, Vol. 52 (pp 25-54)
  • Apt, K.R., Schaerf, A. (1999) Programming in Alma-0, or Imperative and Declarative Programming Reconciled.
    In Gabbay, D.M. de Rijke, M. (Eds.), Frontiers of Combining Systems 2 (pp 1-16). Research Studies Press Ltd.
    Chapter | UvA-DARE
  • Apt, K.R., Schäfer, G. (2012) Selfishness level of strategic games.
    In Serna, M. (Eds.), Algorithmic Game Theory: 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings (pp 13-24) (Lecture Notes in Computer Science, Vol. 7615). Springer.
  • Apt, K.R., Schäfer, G. (2014) Selfishness Level of Strategic Games.
    Journal of Artificial Intelligence Research, Vol. 49 (pp 207-240)
  • Apt, K.R., Schrijver, A., Temme, N. (1994) From Universal Morphisms to Megabytes: A Baayen Space Odyssey.
    CWI.
    Book | UvA-DARE
  • Apt, K.R., Simon, S. (2012) A classification of weakly acyclic games.
    In Serna, M. (Eds.), Algorithmic Game Theory: 5th international symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012: proceedings (pp 1-12) (Lecture Notes in Computer Science, Vol. 7615). Springer.
  • 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)

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