
WellFounded Extensive Games with Perfect Information
We consider extensive games with perfect information with wellfounded g...
read it

Edsger W. Dijkstra: a Commemoration
This article is a multiauthored portrait of Edsger Wybe Dijkstra that co...
read it

Edsger Dijkstra. The Man Who Carried Computer Science on His Shoulders
This a biographical essay about Edsger Wybe Dijkstra....
read it

Coordination Games on Weighted Directed Graphs
We study strategic games on weighted directed graphs, in which the payof...
read it

Reasoning about callbyvalue: a missing result in the history of Hoare's logic
We provide a sound and relatively complete Hoarelike proof system for r...
read it

Open Problems in a Logic of Gossips
Gossip protocols are programs used in a setting in which each agent hold...
read it

Fifty years of Hoare's Logic
We discuss a history of Hoare's logic....
read it

SelfStabilization Through the Lens of Game Theory
In 1974 E.W. Dijkstra introduced the seminal concept of selfstabilizati...
read it

Common Knowledge in a Logic of Gossips
Gossip protocols aim at arriving, by means of pointtopoint or group co...
read it

Epistemic Protocols for Distributed Gossiping
Gossip protocols aim at arriving, by means of pointtopoint or group co...
read it

Edsger Wybe Dijkstra (1930 – 2002): A Portrait of a Genius
We discuss the scientific contributions of Edsger Wybe Dijkstra, his opi...
read it

One More Revolution to Make: Free Scientific Publishing
Computer scientists are in the position to create new, free highquality...
read it

A Denotational Semantics for FirstOrder Logic
In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational ...
read it

Programming in Alma0, or Imperative and Declarative Programming Reconciled
In (Apt et al, TOPLAS 1998) we introduced the imperative programming lan...
read it

Some Remarks on Boolean Constraint Propagation
We study here the wellknown propagation rules for Boolean constraints. ...
read it

Constraint Programming viewed as Rulebased Programming
We study here a natural situation when constraint programming can be ent...
read it

Automatic Generation of Constraint Propagation Algorithms for Small Finite Domains
We study here constraint satisfaction problems that are based on predefi...
read it

The Rough Guide to Constraint Propagation
We provide here a simple, yet very general framework that allows us to e...
read it

The Essence of Constraint Propagation
We show that several constraint propagation algorithms (also called (loc...
read it

A Proof Theoretic View of Constraint Programming
We provide here a proof theoretic account of constraint programming that...
read it
Krzysztof R. Apt
is this you? claim profile
Senior researcher (from 2008 CWI Fellow), CWI (Centre for Math. and Comp. Science), Amsterdam, The Netherlands since 1987, Full Professor, Institute for Language, Logic and Computation, University of Amsterdam, The Netherlands since 1991, Visiting Professor, Computer Science Department, National University of Singapore, Singapore 20022005, William B. Blakemore II Professor, Dept. of Computer Sciences, University of Austin, Texas, U.S.A. 19871990, CNRS, Chargé de recherche, University of Paris and (1986 – 1987) Ecole Normale Superieure, Paris, France 19811987, Assistant Professor, Dept. of Economics, Erasmus University, Rotterdam, The Netherlands 19781981, Postdoc, Dept. of Mathematics, Catholic University of Nijmegen, Nijmegen, The Netherlands 19741975, PhD in mathematics, Institute of Mathematics, Polish Academy of Sciences, Warsaw, Poland 1974