Efficient algorithms for qualitative reasoning about time
Tractable reasoning via approximation
Naming and identity in epistemic logic part II: a first-order logic for naming
Nested abnormality theories
On the computational complexity of querying bounds on differences constraints
Levesque's axiomatization of only knowing is incomplete
Sloman's view of Gödel's sentence
Announcement
Forthcoming papers
Author index—Volume 74 (1994)