Searchable List of Research Output

Filter Publications
  • Apt, K. R., & Witzel, S. A. (2007). A Generic Approach to Coalition Formation. Institute for Logic Language and Computation. http://arxiv.org/abs/0709.0435 >>>
  • Apt, K. R., & Wojtczak, D. (2019). Open Problems in a Logic of Gossips. Electronic Proceedings in Theoretical Computer Science, 297, 1-18. https://doi.org/10.4204/EPTCS.297.1 >>>
  • 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. >>>
  • Apt, K. R., & Zoeteweij, P. (2004). A Comparative Study of Arithmetic Constraints on Integer Intervals. In K. R. Apt, F. Fages, F. Rossi, P. Szeredi, & J. Váncza (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; Vol. 3010), (Lecture Notes in Artificial Intelligence). Springer. https://doi.org/10.1007/978-3-540-24662-6_1 >>>
  • Apt, K. R., & Zoeteweij, P. (2007). An Analysis of Arithmetic Constraints on Integer Intervals. Constraints, 12(4), 429-468. https://doi.org/10.1007/s10601-007-9017-9 >>>
  • Apt, K. R., & Zvesper, J. A. (2010). The role of monotonicity in the epistemic analysis of strategic games. Games, 1(4), 381-394. https://doi.org/10.3390/g1040381 >>>
  • Apt, K. R. (1995). Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming. In M. I. Sessa, & M. Alpuente Frasnedo (Eds.), 1995 Joint Conference on Declarative Programming (GULP-PRODE '95) (pp. 19-35). University of Salerno, Italy. >>>
  • Apt, K. R. (1998). Formulas as programs. (PNA; No. R9809). WINS (oud WINS). >>>
  • Apt, K. R. (1998). Alma-O: An Imperative Language that supports declarative programming. ACM Transactions on Programming Languages and Systems, 20(5), 1014-1066. >>>
  • Apt, K. R. (1998). Special Issue: foundations of constraint programming. Fundamenta Informaticae, 34(3), ---. >>>
  • Apt, K. R. (1998). CWI Quarterly: Special issue on constraints. (-; No. vol. 2-3). CWI. >>>
  • Apt, K. R. (1998). View of constraint programming. Fundamenta Informaticae, 33(3), 263-293. >>>
  • Apt, K. R. (2000). Some Remarks on Boolean Constraint Propagation. In New Trends in Constraints (pp. 91-107). (Lecture Notes in Artificial Intelligence; No. 1865). Springer Verlag. >>>
  • Apt, K. R. (2000). A Denotational Semantics For First-Order Logic. Lecture Notes in Computer Science, 1861, 53-69. >>>
  • Apt, K. R. (2000). Editorial. ACM Transactions on Computational Logic, 1(1), 1-2. >>>
  • Apt, K. R. (2000). The Role of Commutativity in Constraint Propagation Algorithms. ACM Transactions on Programming Languages and Systems, 22(6), 1002-1036. https://doi.org/10.1145/371880.371884 >>>
  • Apt, K. R. (2001). One More Revolution to Make: Free Scientific Publishing. Communications of the ACM, 44(5), 25-28. >>>
  • Apt, K. R. (2002). Edsger Wybe Dijkstra (1930 - 2002): A portrait of a genius''. Formal Aspects of Computing, 14(2), 92-98. >>>
  • Apt, K. R. (2002). The logic programming paradigm and Prolog. In J. Mitchell (Ed.), Concepts in Programming Languages (pp. 475-507). Cambridge University Press. >>>
  • Apt, K. R. (2002). [Review of: Mordechai Ben-Ari. Mathematical Logic for Computer science]. Theory and Practice of Logic Programming, 2(1), 123-124. >>>

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