Searchable List of Research Output

Filter Publications
  • Apt, K. R., & Gabbrielli, M. (1994). Declarative Interpretations Reconsidered. In P. van Hentenryck (Ed.), ICLP94 (pp. 74-89). MIT Press. >>>
  • Apt, K. R., & Grädel, E. (2011). Lectures in game theory for computer scientists. Cambridge University Press. >>>
  • Apt, K. R., Grossi, D., & van der Hoek, W. (2016). Epistemic protocols for distributed gossiping. Electronic Proceedings in Theoretical Computer Science, 215, 51-66. >>>
  • Apt, K. R., Kakas, A. C., Monfroy, E., & Rossi, F. (2000). New Trends in Constraints, Lecture Notes in Artificial Intelligence 1865. Springer Verlag. >>>
  • Apt, K. R., Kakas, A. C., & Sadri, F. (2001). Editorial. ACM Transactions on Computational Logic, 2(4), 431-431. >>>
  • Apt, K. R., & Luitjes, I. (1995). Verification of Logic Programs with Delay Declarations. In M. Nivat, & V. S. Alagar (Eds.), Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST'95) (pp. 66-90). (Lecture Notes in Computer Science; No. 936). Springer-Verlag. >>>
  • Apt, K. R., Marchiori, E., & Palamidessi, C. (1994). A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computing, 5(3/4), 159-191. >>>
  • Apt, K. R., & Marchiori, E. (1994). Reasoning about Prolog Programs: from Modes through Types to Assertions. Formal Aspects of Computing, 6(6A), 743-765. >>>
  • Apt, K. R., & Markakis, E. (2009). Optimal strategies in sequential bidding. In K. S. Decker, J. S. Sichman, C. Sierra, & C. Castelfranchi (Eds.), AAMAS 2009: the 8th International Conference on Autonomous Agents and Multiagent Systems: May 10-15, 2009, Budapest, Hungary: proceedings. - Volume 2 (pp. 1189-1190). IFAAMAS. >>>
  • Apt, K. R., & Markakis, E. (2009). Sequential bidding in the Bailey-Cavallo mechanism. In S. Leonardi (Ed.), Internet and Network Economics: 5th International Workshop, WINE 2009, Rome, Italy, December 14-18, 2009 : proceedings (pp. 483-490). (Lecture Notes in Computer Science; Vol. 5929). Springer. >>>
  • Apt, K. R., & Markakis, E. (2011). Diffusion in social networks with competing products. In G. Persiano (Ed.), Algorithmic Game Theory: 4th International Symposium, SAGT 2011, Amalfi, Italy, October 17-19 2011: proceedings (pp. 212-223). (Lecture Notes in Computer Science; Vol. 6982). Springer. >>>
  • Apt, K. R., & Markakis, E. (2014). Social Networks with Competing Products. Fundamenta Informaticae, 129(3), 225-250. >>>
  • Apt, K. R., & Monfroy, E. (2001). Constraint Programming viewed as Rule-based Programming. Theory and Practice of Logic Programming, 1(6), 713-750. >>>
  • Apt, K. R., & Olderog, E. R. (1994). Programmverifikation. Springer Verlag. >>>
  • Apt, K. R., & Pedreschi, D. (1994). Modular Termination Proofs for Logic and Pure Prolog Programs. In G. Levi (Ed.), Advances in Logic Programming Theory (pp. 183-229). Oxford University Press. >>>
  • Apt, K. R., & Pellegrini, A. (1994). On the occur-check free Prolog programs. ACM Transactions on Programming Languages and Systems, 16(3), 687-726. >>>
  • Apt, K. R., Rahn, M., Schäfer, G., & Simon, S. (2014). Coordination Games on Graphs. In T.-Y. Liu, Q. Qi, & Y. Ye (Eds.), Web and Internet Economics: 10th International Conference, WINE 2014, Beijing, China, December 14-17, 2014: proceedings (pp. 441-446). (Lecture Notes in Computer Science; Vol. 8877). Springer. >>>
  • Apt, K. R., Rossi, F., & Venable, K. B. (2005). CP-nets and Nash equilibria. In Proceedings of CIRAS '05 (pp. 1-6). Elsevier. >>>
  • Apt, K. R., Rossi, F., & Venable, K. B. (2008). A comparison of the notions of optimality in soft constraints and graphical games. In F. Fages, F. Rossi, & S. Soliman (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, 52(1), 25-54. >>>

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