| A complete classification of tractability in RCC-5 T Drakengren, P Jonsson Journal of Artificial Intelligence Research 6, 211-221, 1997 | 100 | 1997 |
| Eight maximal tractable subclasses of Allen's algebra with metric time T Drakengren, P Jonsson Journal of Artificial Intelligence Research 7, 25-45, 1997 | 60 | 1997 |
| A complete classification of tractability in Allen's algebra relative to subsets of basic relations T Drakengren, P Jonsson Artificial Intelligence 106 (2), 205-219, 1998 | 55 | 1998 |
| Twenty-one large tractable subclasses of Allen's algebra T Drakengren, P Jonsson Artificial Intelligence 93 (1-2), 297-319, 1997 | 45 | 1997 |
| Computational complexity of relating time points with intervals P Jonsson, T Drakengren, C Bäckström Artificial Intelligence 109 (1-2), 273-295, 1999 | 29 | 1999 |
| Maximal tractable subclasses of Allen's interval algebra: Preliminary report T Drakengren, P Jonsson Universitetet i Linköping/Tekniska Högskolan i Linköping. Institutionen för …, 1996 | 28 | 1996 |
| Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report T Drakengren, P Jonsson | 28 | 1996 |
| Towards a complete classification of tractability in Allen's algebra T Drakengren, P Jonsson IJCAI, 1466-1475, 1997 | 26 | 1997 |
| Reasoning about action in polynomial time T Drakengren, M Bjäreland Artificial Intelligence 115 (1), 1-24, 1999 | 12 | 1999 |
| Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. P Jonsson, T Drakengren, C Bäckström KR, 352-363, 1996 | 10 | 1996 |
| Reasoning About Set Constraints Applied to Tractable Inference in Instutionstic Logic T Drakengren, P Jonsson Journal of Logic and Computation 8 (6), 855-875, 1998 | 9 | 1998 |
| Computational complexity of temporal constraint problems T Drakengren, P Jonsson Foundations of Artificial Intelligence 1, 197-218, 2005 | 8 | 2005 |
| Uniqueness of Scott's reflexive domain in Pω T Drakengren Theoretical Computer Science 155 (1), 267-276, 1996 | 6 | 1996 |
| Algorithms and Complexity for Temporal and Spatial Formalisms T Drakengren Department of Computer and Information Science, Linköping University, 1997 | 3 | 1997 |
| Expressive reasoning about action in nondeterministic polynomial time T Drakengren, M Bjäreland IJCAI, 166-171, 1999 | 2 | 1999 |
| A decidable canonical representation of the compact elements in Scott's reflexive domain in Pω T Drakengren Theoretical computer science 193 (1-2), 181-195, 1998 | 1 | 1998 |
| Compositionality and the frame problem T Drakengren Universitetet i Linköping/Tekniska Högskolan i Linköping. Institutionen för …, 1996 | 1 | 1996 |
| RCC-5 and its Tractable Subclasses P Jonsson, T Drakengren Institutionen för datavetenskap, Universitetet och tekniska högskolan Linköping, 1996 | 1 | 1996 |
| Uniqueness of Scott’s reflexive domain in Pω T Drakengren Master’s thesis, Linköping University, Department of Mathematics, 1994. LiTH …, 1994 | 1* | 1994 |
| Reasoning about Action in Polynomial Time T Drakengren, M Bjäreland IJCAI, 1997 | | 1997 |
Peter JonssonProfessor in Computer Science, Linköping UniversityVerified email at liu.se
Peter JonssonProfessor in Computer Science, Linköping UniversityVerified email at liu.se