1. C. Backstrom, 1988 . Reasoning about interdependent actions . Licentiate Thesis, 139 , Department of Computer and Information Science, Linkoping University, Linkoping, Sweden.
2. C. Backstrom, Z. W. W, and L. Saitta, 1988 . A representation of coordinated actions characterized by interval valued conditions . InProceedings of the 3rd International Symposium on Methodologies for Intelligent Systems (ISMIS-88). Torino, Italy, North-Holland, pp.220 -229 .
3. C. Backstrom, 1992 . Computational Complexity of Reasoning about Plans . Doctoral dissertation , Linkoping University, Linkoping, Sweden.
4. C. Backstrom, B. Swartout, and B. Nebel, 1992 . Equivalence and tractability results for SAS+planning .InProceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR-92). Morgan Kaufmann, Cambridge, MA. pp.126 -137 .