[2012]
[2011][2010]
[2009][2008]
[2007][2006]
[2005][2004]
[2003][2002]
[2001][2000]
[1999][1998]
[1997][1996]
[1995][1994]
[1993]
2012
- K.R. Apt and E. Markakis,
Social Networks with Competing Products
.
-
Book review of "Logic: a Brief Course" by Daniele Mundici.
Springer, Theory and Practice of Logic Programming. To appear.
- M. Guo, E. Markakis, K.R. Apt, V. Conitzer
Undominated Groves Mechanisms.
- A. Witzel, K.R. Apt and J.A. Zvesper,
Distributed iterated elimination of strictly dominated strategies
.
Autonomous Agents and Multi-Agent Systems.
Vol. 25(2), pp. 395-418.
- K.R. Apt, F.S. de Boer, E.-R. Olderog and S. de Gouw
Verification of Object-Oriented Programs: a Transformational Approach.
Journal of Computer and System Sciences. ,
Vol. 78(3), pp. 823-852.
- K.R. Apt and G. Schaefer,
Selfishness Level of Strategic Games.
- S. Simon and K.R. Apt,
Choosing Products in Social Networks
.
2011
- F. Sietsma and K.R. Apt,
Common Knowledge in Email Exchanges
.
- K.R. Apt and E. Markakis,
Diffusion in Social Networks with Competing Products
.
Proc. 4th International Symposium on Algorithmic Game Theory, (SAGT 2011).
Lecture Notes in Computer Science 6982, Springer, pp. 212-223.
- K.R. Apt,
A Primer on Strategic Games,
in Lectures in Game Theory for Computer Scientists,
K.R. Apt and E. Graedel (editors),
Cambridge University Press, pp. 1-37.
- K.R. Apt,
Direct Proofs of Order Independence.
Economics Bulletin, 31(1), pp. 106-115.
- K.R. Apt, F. Arbab and H. Ma,
A System for Distributed Mechanisms: Design, Implementation and Applications.
2010
- K.R. Apt and J.A. Zvesper,
Public Announcements in Strategic Games with Arbitrary Strategy Sets
.
LOFT 2010.
- K.R. Apt and J.A. Zvesper,
The Role of Monotonicity in the Epistemic Analysis of Strategic Games
.
Games 1(4), pp. 381--394.
- J.A. Zvesper and K.R. Apt,
Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets
.
Proc. 11th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XI).
Lecture Notes in Computer Science 6245, Springer, pp. 186-199.
- K.R. Apt and L. Zuck,
Obituary: Amir Pnueli (1941-2009)
.
Bulletin of EATCS 100, pp. 9-10, (2010).
- K.R. Apt,
Book review of "Logicomix: An Epic Search for Truth", by
A. Doxiadis, C.H. Papadimitriou, A. Papadatos and A. di Donna.
Bloomsbury, The Mathematical Intelligencer, 32(3), pp. 51-52, 2010.
2009
- K.R. Apt and E. Markakis,
Sequential Bidding in the Bailey-Cavallo Mechanism
.
Proc. 5th Workshop on Internet & Network Economics, (WINE'09).
Lecture Notes in Computer Science 5929, Springer, pp. 483-490.
- A. Witzel, K.R. Apt and J.A. Zvesper,
Strategy elimination in games with interaction structures.
Proc. 2nd International Workshop on Logic,
Rationality and Interaction (LORI-II).
Lecture Notes in Artificial Intelligence 5834, Springer, pp. 302-315.
- K.R. Apt and A. Estevez-Fernandez,
Sequential pivotal mechanisms for public project problems.
Proc. 2nd International Symposium on Algorithmic Game Theory, (SAGT 2009).
Lecture Notes in Computer Science 5385, Springer, pp. 85-96.
- K.R. Apt, A. Witzel and J.A. Zvesper,
Common knowledge in interaction structures.
Proc. 12th Conference on
Theoretical Aspects of Rationality and Knowledge
(TARK XII),
The ACM Digital Library, pp. 4-13.
- K.R. Apt, F.S. de Boer and E.R. Olderog,
Modular Verification of Recursive Programs.
Languages: From Formal to Natural, Essays
Dedicated to Nissim Francez on the Occasion of His 65th Birthday.
Lecture Notes in Computer Science 5533, Springer, pp. 1-21.
- K.R. Apt and A. Witzel,
A Generic Approach to Coalition Formation.
International Game Theory Review (IGTR) 11(3), pp. 347-367.
- K.R. Apt and E. Markakis,
Optimal Strategies in Sequential Bidding (Extended Abstract) .
Proc. of AAMAS 2009, pp. 1189-1190.
2008
- K.R. Apt and E. Markakis,
Optimal Strategies in Sequential Bidding.
- K.R. Apt, F. Arbab and H. Ma,
Distributed Platform for Mechanism Design.
Proc. International Conference on Computational Intelligence for Modelling, Control and Automation,
IEEE Society, pp. 1-6.
- K.R. Apt, V. Conitzer, M. Guo and E. Markakis,
Welfare Undominated Groves Mechanisms.
Proc. Workshop on Internet & Network Economic (WINE2008).
Lecture Notes in Computer Science 5385, Springer,
pp. 426-437.
- K.R. Apt, F. Rossi, and K.B. Venable
Comparing the notions of optimality in CP-nets, strategic games and soft constraints
.
Annals of Mathematics and Artificial Intelligence 52(1), pp. 25-54.
- K.R. Apt, F. Rossi, and K.B. Venable
A comparison of the notions of optimality in
soft constraints and graphical games.
Recent Advances in Constraints.
Lecture Notes in Artificial Intelligence 5129, pp. 1-18.
2007
- K.R. Apt and J.A. Zvesper,
Common Beliefs and Public Announcements in Strategic Games with Arbitrary Strategy Sets.
- K.R. Apt,
The Many Faces of Rationalizability,
.
The B.E. Journal of Theoretical Economics, 7(1), (Topics), Article 18, 38 pages.
- K.R. Apt,
Relative Strength of Strategy Elimination Procedures,
.
Economics Bulletin, 3(21), pp. 1-9.
- K.R. Apt,
Epistemic Analysis of Strategic Games with Arbitrary Strategy Sets,
Proc. 11th Conference on
Theoretical Aspects of Rationality and Knowledge
(TARK XI), pp. 22-38. The ACM Digital Library.
- K.R. Apt and A. Estevez-Fernandez,
Sequential Mechanism Design
- K.R. Apt,
Post your articles in ArXiv:Math and CoRR!
Nieuw Archief voor Wiskunde 5/8 nr. 2, pp. 98-99.
(about scientific publishing)
- K.R. Apt and P. Zoeteweij,
An Analysis of Arithmetic Constraints on Integer Intervals,
Constraints journal, 12(4), pp. 429-468.
.
- K.R. Apt,
Book review of "Alfred Tarski: Life and Logic", by
A. Burdman Feferman and S. Feferman,
Cambridge University Press, 2004,
The Mathematical Intelligencer, 29(2), pp. 78-80.
2006
2005
- K.R. Apt,
Explaining Constraint Programming,
Processes, Terms and Cycles: Steps on the Road to Infinity,
Lecture Notes in Computer Science 3838, Springer, pp. 55-69.
-
K.R. Apt, F. Rossi and K. B. Venable,
CP-nets and Nash equilibria,
Proc. Third International Conference on
Computational Intelligence, Robotics and Autonomous Systems (CIRAS '05).
- S. Brand and K.R. Apt,
Schedulers and Redundancy for a Class of Constraint Propagation Rules,
Theory and Practice of Logic Programming 5(4&5), pp. 441-465.
- K.R. Apt and S. Brand,
Constraint-Based Qualitative Simulation
,
Proc. 12th International Symposium on Temporal Representation and Reasoning
(TIME '05), pp. 26-34.
- K.R. Apt,
Order Independence and Rationalizability
,
Proc. 10th Conference on Theoretical Aspects of Rationality and
Knowledge (TARK X),
The ACM Digital Library, pp. 22-38.
2004
- K.R. Apt,
Uniform Proofs of Order Independence for Various Strategy Elimination Procedures,
The B.E. Journal of Theoretical Economics, 4(1), (Contributions), Article 5, 48 pages.
- K.R. Apt and P. Zoeteweij,
A Comparative Study of Arithmetic Constraints on Integer Intervals
, Recent Advances in Constraints.
Lecture Notes in Computer Science 3010, Springer, pp. 1-24.
2003
2002
- K.R. Apt,
Edsger Wybe Dijkstra (1930 -- 2002): A Portrait of a Genius
.
Formal Aspects of Computing, 14, pp. 92-98.
- K.R. Apt and C.F.M. Vermeulen,
First-order Logic as a Constraint Programming Language.
Proc. Logic for Programming, Artificial Intelligence, and Reasoning
(LPAR 2002),
Lecture Notes in Artificial Intelligence 2514, Springer, pp. 19-35.
- K.R. Apt,
The Logic Programming Paradigm and Prolog.
(Chapter 15 in
Concepts in Programming Languages , J. Mitchell, Cambridge University Press (2002).
)
- K.R. Apt,
Book review of "Mathematical Logic for Computer Science (Second Revised Edition)",
by Mordechai Ben-Ari, Springer, 2001.
Theory and Practice of Logic Programming 2(1) pp. 123-124 (2002).
2001
- K.R. Apt and J.-G. Smaus,
Rule-based versus Procedure-based View of Programming.
Joint Bulletin of the Novosibirsk Computing Center and Institute of Informatics
Systems, Series: Computer Science, 16, pp. 75-97.
- K.R. Apt and E. Monfroy,
Constraint Programming viewed as Rule-based Programming.
Theory and Practice of Logic Programming (TPLP) 1(6) pp. 713 - 750.
- K.R. Apt,
Towards Free Access to Scientific Literature.
Nieuw Archief voor Wiskunde, 5/2 nr. 3, september 2001, pp. 251-255.
(about scientific publishing)
- K.R. Apt,
One More Revolution to Make: Free Scientific Publishing.
Communications of ACM, 44(5), pp. 25-28.
(Taken from
http://www.acm.org/pubs/citations/journals/cacm/2001-44-5/p25-apt/.
Posted with permission of the ACM. )
(about scientific publishing)
2000
- K.R. Apt,
The Role of Commutativity in Constraint Propagation Algorithms.
ACM TOPLAS, 22(6), pp. 1002 - 1036.
(For ACM Interim Copyright Policy see here.)
- K.R. Apt,
A Denotational Semantics for First-Order Logic.
Proc. Computational Logic Conference (CL2000),
(invited lecture),
Lecture Notes in Artificial Intelligence 1861, Springer, pp. 53-69.
- K.R. Apt and A. Schaerf,
Programming in Alma-0, or Imperative
and Declarative Programming Reconciled, in
Frontiers of Combining Systems 2, Research Studies Press Ltd,
D. M. Gabbay and M. de Rijke (editors), pp. 1-16.
- K.R. Apt,
Some Remarks on Boolean Constraint Propagation, in
New Trends in Constraints,
Lecture Notes in
Artificial Intelligence 1865, Springer, pp. 91-107.
1999
- K.R. Apt,
Book review of Programming With Constraints : An Introduction,
by Kim Marriott, Peter J. Stuckey, The MIT Press, 1998.
Artificial Intelligence in Medicine, 16, pp. 315-319.
- K.R. Apt,
The Essence of Constraint Propagation.
Theoretical Computer Science, 221(1-2), pp. 179-210.
- K.R. Apt and M. Bezem,
Formulas as Programs.
in The Logic Programming Paradigm: A 25 Years Perspective,
K.R. Apt, V. Marek, M. Truszczynski and D.S. Warren (editors),
Springer-Verlag, Artificial Intelligence Series,
pp. 75-107.
- K.R. Apt, E. Monfroy,
Automatic generation of constraint propagation
algorithms for small finite domains.
Proc. 5th International Conference on
Principles and Practice of Constraint Programming (CP'99),
Springer-Verlag Lecture Notes in
Computer Science 1713, pp. 58-72.
- K.R. Apt,
The Rough Guide to Constraint Propagation
(Corrected version.)
Proc. 5th International Conference on
Principles and Practice of Constraint Programming (CP'99),
(invited lecture), Springer-Verlag Lecture Notes in
Computer Science 1713, pp. 1-23.
- K.R. Apt and A. Schaerf,
The Alma Project, or How First-Order Logic Can Help Us in Imperative
Programming.
E.-R. Olderog, B. Steffen, Eds.: "Correct
System Design.
Springer-Verlag Lecture Notes in Computer Science 1710,
pp. 89-113.
- K.R. Apt,
A Logical Analysis of Boolean Constraints.
Amsterdam University Press, Vossiuspers,
JFAK. Essays Dedicated to Johan van Benthem on the
Occasion of his 50th Birthday.
1998
1997
1996
- K.R. Apt and R. Ben-Eliyahu,
Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax,
Fundamenta Informaticae, 28, 1-2, pp. 23-36 (1996).
- K.R. Apt,
Arrays, Bounded Quantification and Iteration
in Logic and Constraint Logic Programming,
Science of Computer Programming, 26, No. 1-3, pp. 133-148 (1996).
- K.R. Apt and M. Gabbrielli and D. Pedreschi,
A Closer Look at Declarative Interpretations,
(almost identical to the journal version)
Journal of Logic Programming, No 2, 147-180 (1996).
1995
-
K.R. Apt,
Program Verification and Prolog,
Specification and Validation methods for Programming languages and systems,
(E. Börger ed.), Oxford University Press, pp. 55-95 (1995).
-
K.R. Apt and F. Teusink,
Comparing negation in logic programming and
in Prolog, in
Meta-logics and Logic Programming,
(K.R. Apt and F. Turini, eds.), The MIT Press, pp. 111-133 (1995).
-
K.R. Apt and I. Luitjes,
Verification of Logic Programs with Delay Declarations,
Proc. 4th International Conference on Algebraic Methodology and
Software Technology (AMAST '95), (invited lecture),
Springer-Verlag Lecture Notes in Computer Science 936, pp. 66-90 (1995).
1994
-
K.R. Apt and K. Doets,
A new definition of SLDNF-resolution,
Journal of Logic Programming 18, No. 2, pp. 177-190, (1994).
-
K.R. Apt and E. Marchiori and C. Palamidessi,
Declarative Approach for First-Order Built-in's in Prolog,
Applicable Algebra in Engineering, Communication and
Computing (AAECC) 5, No. 3/4, pp. 159-191, (1994).
-
K.R. Apt and A. Pellegrini,
On the occur-check free Prolog programs,
(almost identical to the journal version)
ACM TOPLAS, 16, No. 3, pp. 687-726, (1994).
-
K.R. Apt and R. Bol,
Logic programming and negation: a survey,
(almost identical to the journal version)
Journal of Logic Programming 19-20, pp. 9-71, (1994).
-
K.R. Apt and E. Marchiori,
Reasoning about Prolog Programs:
from Modes through Types to Assertions,
Formal Aspects of Computing (FACS) 6, No. 6A, pp. 743-765, (1994).
-
K.R. Apt and M. Gabbrielli,
Declarative Interpretations Reconsidered,
Proc.International Conference on Logic Programming
(ICLP '94), The MIT Press, pp. 74-89 (1994).
-
K.R. Apt and P. van Emde Boas and A. Welling,
The STO-problem is NP-hard,
Journal of Symbolic Computation, 18, pp. 489-495 (1994).
1993
-
K.R. Apt and D. Pedreschi,
Reasoning about termination of pure Prolog programs,
Information and Computation 106,
No. 1, pp. 109-157, (1993).
-
K.R. Apt and S. Etalle,
On the unification free Prolog programs,
Proc. Conference on Mathematical Foundations of Computer Science
(MFCS '93), (invited lecture), Springer-Verlag Lecture Notes in
Computer Science 711, pp. 1-19 (1993).
-
K.R. Apt,
Declarative programming in Prolog,
Proc. International Logic Programming Symposium
(ILPS '93), (invited lecture), The MIT Press, pp. 12-35 (1993).
[Home]
This page is maintained by
Krzysztof R. Apt
CWI DISCLAIMER