Books, Theses, Book Chapters
Thomas Drakengren and Peter Jonsson (2005). Computational Complexity of Temporal Constraint Problems. In Michael Fisher, Dov Gabbay, and Lluís Vila (eds.), Handbook of Temporal Reasoning in Artificial Intelligence , Elsevier, pp. 197-218.
Drakengren, T. (1997). Algorithms and Complexity for Temporal and Spatial Formalisms. Doctoral dissertation, Linköping University.
Drakengren, T. (1994). Uniqueness of Scott's Reflexive Domain in P-omega. Master's thesis, Linköping University, Department of Mathematics. LiTH-MAT-EX-94-02. An errata sheet is available here.
Journal Articles
Drakengren, T. and Bjäreland, M. (1999) Reasoning about action in polynomial time. Artificial Intelligence 115(1):1-24.
Jonsson, P., Drakengren, T., and Bäckström, C. (1999) Computational complexity of relating time points with intervals. Artificial Intelligence 109(1-2):273-295.
Drakengren , T. and Jonsson, P. A complete classification of tractability in Allen's algebra relative to subsets of basic relations. (1998) Artificial Intelligence 106(2):205-219.
Drakengren, T. and Jonsson, P. (1998) Reasoning about set constraints applied to tractable inference in intuitionistic logic. Journal of Logic and Computation 8(6):855-875.
Drakengren, T. (1998) A decidable canonical representation of the compact elements in Scott's reflexive domain in P-omega. Theoretical Computer Science, 193(1-2):181-195.
Drakengren, T. and Jonsson, P. (1997). Eight maximal tractable subclasses of Allen's algebra with metric time. Journal of Artificial Intelligence Research, 7:25-45.
Drakengren, T. and Jonsson, P. (1997). Twenty-one large tractable subclasses of Allen's algebra. Artificial Intelligence, 93(1-2):297-319.
Jonsson, P. and Drakengren, T. (1997). A complete classifaction of tractability in RCC-5.Journal of Artificial Intelligence Research, 6:211-221.
Drakengren, T. (1996). Uniqueness of Scott's reflexive domain in P-omega. Theoretical Computer Science, 155(1):267-276.
Archival Conferences
Drakengren, T. and Bjäreland, M. (1999). Expressive Reasoning about Action in Nondeterministic Polynomial Time. In Proceedings of the 16th International Joint Conference on Artificial Intelligence, IJCAI '99.
Drakengren, T. and Bjäreland, M. (1997). Reasoning about Action in Polynomial Time. InProceedings of the 15th International Joint Conference on Artificial Intelligence, IJCAI '97.
Drakengren, T. and Jonsson, P. (1997). Towards a Complete Classification of Tractability in Allen's Algebra. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, IJCAI '97.
Drakengren, T. and Jonsson, P. (1996). Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. In Proceedings of the National Conference of Artificial Intelligence, AAAI '96.
Jonsson, P., Drakengren, T., and Bäckström, C. (1996). Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. In Proceedings of the 5th International Conference on Principles on Knowledge Representation and Reasoning, KR '96.
Technical Reports
Drakengren, T. (1996). Compositionality and the Frame Problem. Technical Report LiTH-IDA-R-96-04.
Drakengren, T. and Jonsson, P. (1996). Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. Technical Report LiTH-IDA-R-96-26.
Drakengren, T. and Jonsson, P. (1996). Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. Technical Report LiTH-IDA-R-96-14.
Jonsson, P. and Drakengren, T. (1996). RCC-5 and its Tractable Subclasses. Technical Report LiTH-IDA-R-96-25.
Back to Thomas Drakengren's home page