Peter Jonsson
Peter Jonsson
Professor in Computer Science, Linköping University
Verified email at liu.se - Homepage
Title
Cited by
Cited by
Year
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
A Krokhin, P Jeavons, P Jonsson
Journal of the ACM (JACM) 50 (5), 591-640, 2003
1872003
State-variable planning under structural restrictions: Algorithms and complexity
P Jonsson, C Bäckström
Artificial Intelligence 100 (1-2), 125-176, 1998
1151998
A unifying approach to temporal constraint reasoning
P Jonsson, C Bäckström
Artificial Intelligence 102 (1), 143-155, 1998
961998
A complete classification of tractability in RCC-5
T Drakengren, P Jonsson
Journal of Artificial Intelligence Research 6, 211-221, 1997
941997
Counting models for 2SAT and 3SAT formulae
V Dahllöf, P Jonsson, M Wahlström
Theoretical Computer Science 332 (1-3), 265-291, 2005
902005
Building tractable disjunctive constraints
D Cohen, P Jeavons, P Jonsson, M Koubarakis
Journal of the ACM (JACM) 47 (5), 826-853, 2000
882000
The complexity of counting homomorphisms seen from the other side
V Dalmau, P Jonsson
Theoretical Computer Science 329 (1-3), 315-323, 2004
812004
Some results on the complexity of planning with incomplete information
P Haslum, P Jonsson
European Conference on Planning, 308-318, 1999
811999
The approximability of three-valued Max CSP
P Jonsson, M Klasson, A Krokhin
SIAM Journal on Computing 35 (6), 1329-1349, 2006
582006
Eight maximal tractable subclasses of Allen's algebra with metric time
T Drakengren, P Jonsson
Journal of Artificial Intelligence Research 7, 25-45, 1997
581997
An algorithm for counting maximum weighted independent sets and its applications
V Dahllöf, P Jonsson
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
572002
Planning with Reduced Operator Sets.
P Haslum, P Jonsson
AIPS, 150-158, 2000
542000
Incremental planning
P Jonsson, C Backstrom
New Trends in AI Planning: Proc. 3rd European workshop on planning. IOS, 1995
501995
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
491998
Planning with abstraction hierarchies can be exponentially less efficient
C Backstrom, P Jonsson
Proceedings of the 14th international joint conference on Artificial …, 1995
481995
The approximability of Max CSP with fixed-value constraints
V Deineko, P Jonsson, M Klasson, A Krokhin
Journal of the ACM (JACM) 55 (4), 1-37, 2008
462008
Point algebras for temporal reasoning: Algorithms and complexity
M Broxvall, P Jonsson
Artificial Intelligence 149 (2), 179-220, 2003
452003
A linear-programming approach to temporal reasoning
P Jonsson, C Bäckström
Proceedings of the thirteenth national conference on Artificial intelligence …, 1996
441996
Improved algorithms for counting solutions in constraint satisfaction problems
O Angelsmark, P Jonsson
International Conference on Principles and Practice of Constraint …, 2003
432003
Twenty-one large tractable subclasses of Allen's algebra
T Drakengren, P Jonsson
Artificial Intelligence 93 (1-2), 297-319, 1997
421997
The system can't perform the operation now. Try again later.
Articles 1–20