| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Peter Jonsson 39 Vilhelm Dahllöf , Peter Jonsson, Magnus Wahlström : Counting Satisfying Assignments in 2-SAT and 3-SAT. COCOON 2002 : 535-543 38 Ola Angelsmark , Peter Jonsson, Svante Linusson , Johan Thapper : Determining the Number of Solutions to Binary CSP Instances. CP 2002 : 327-340 37 Ola Angelsmark , Vilhelm Dahllöf , Peter Jonsson: Finite Domain Constraint Satisfaction Using Quantum Computation. MFCS 2002 : 93-103 36 Vilhelm Dahllöf , Peter Jonsson: An algorithm for counting maximum weighted independent sets and its applications. SODA 2002 : 292-298 35 Andrei A. Krokhin , Peter Jeavons , Peter Jonsson: The Complexity of Constraints on Intervals and Lengths. STACS 2002 : 443-454 34 Andrei A. Krokhin , Peter Jonsson: Extending the Point Algebra into the Qualitative Algebra. TIME 2002 : 28-35 33 Mathias Broxvall , Peter Jonsson, Jochen Renz : Disjunctions, independence, refinements. Artificial Intelligence 140 (1/2): 153-173 (2002) 32 Andrei A. Krokhin , Peter Jeavons , Peter Jonsson: A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. IJCAI 2001 : 83-88 31 Andrei A. Krokhin , Peter Jeavons , Peter Jonsson: The complexity of constraints on intervals and lengths. Electronic Colloquium on Computational Complexity (ECCC) (077): (2001) 30 Mathias Broxvall , Peter Jonsson: Disjunctive Temporal Reasoning in Partially Ordered Models of Time. AAAI/IAAI 2000 : 464-469 29 Patrik Haslum , Peter Jonsson: Planning with Reduced Operator Sets. AIPS 2000 : 150-158 28 Mathias Broxvall , Peter Jonsson, Jochen Renz : Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints. CP 2000 : 114-127 27 Ola Angelsmark , Peter Jonsson: Some Observations on Durations, Scheduling and Allen's Algebra. CP 2000 : 484-488 26 Peter Jonsson, Patrik Haslum , Christer Bäckström : Towards efficient universal planning: A randomized approach. Artificial Intelligence 117 (1): 1-29 (2000) 25 David A. Cohen , Peter Jeavons , Peter Jonsson, Manolis Koubarakis : Building tractable disjunctive constraints. JACM 47 (5): 826-853 (2000) 24 Peter Jonsson: Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. TCS 244 (1-2): 189-203 (2000) 23 Marcus Bjäreland , Peter Jonsson: Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP. CP 1999 : 118-128 22 Mathias Broxvall , Peter Jonsson: Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time. CP 1999 : 129-143 21 Patrik Haslum , Peter Jonsson: Some Results on the Complexity of Planning with Incomplete Information. ECP 1999 : 308-318 20 Peter Jonsson: Strong bounds on the approximability of two Pspace-hard problems in propositional planning. Annals of Mathematics and Artificial Intelligence 26 (1-4): 133-147 (1999) 19 Peter Jonsson, Thomas Drakengren , Christer Bäckström : Computational Complexity of Relating Time Points with Intervals. Artificial Intelligence 109 (1-2): 273-295 (1999) 18 Peter Jonsson, Paolo Liberatore : On the Complexity of Finding Satisfiable Subinstances in Constraint Satisfaction. Electronic Colloquium on Computational Complexity (ECCC) 6 (38): (1999) 17 Peter Jonsson, Christer Bäckström : Tractable Plan Existence Does Not Imply Tractable Plan Generation. Annals of Mathematics and Artificial Intelligence 22 (3-4): 281-296 (1998) 16 Peter Jonsson, Christer Bäckström : State-Variable Planning Under Structural Restrictions: Algorithms and Complexity. Artificial Intelligence 100 (1-2): 125-176 (1998) 15 Peter Jonsson, Christer Bäckström : A Unifying Approach to Temporal Constraint Reasoning. Artificial Intelligence 102 (1): 143-155 (1998) 14 Thomas Drakengren , Peter Jonsson: A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. Artificial Intelligence 106 (2): 205-219 (1998) 13 Peter Jonsson: Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. Information Processing Letters 68 (5): 249-253 (1998) 12 Thomas Drakengren , Peter Jonsson: Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. Journal of Logic and Computation 8 (6): 855-875 (1998) 11 Thomas Drakengren , Peter Jonsson: Towards a Complete Classification of Tractability in Allen's Algebra. IJCAI 1997 : 1466-1475 10 Thomas Drakengren , Peter Jonsson: Twenty-One Large Tractable Subclasses of Allen's Algebra. Artificial Intelligence 93 : 297-319 (1997) 9 Peter Jonsson: A Nonapproximability Result for Finite Function Generation. Information Processing Letters 63 (3): 143-145 (1997) 8 Peter Jonsson, Thomas Drakengren : A Complete Classification of Tractability in RCC-5. JAIR 6 : 211-221 (1997) 7 Thomas Drakengren , Peter Jonsson: Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. JAIR 7 : 25-45 (1997) 6 Thomas Drakengren , Peter Jonsson: Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. AAAI/IAAI, Vol. 1 1996 : 389-394 5 Peter Jonsson, Christer Bäckström : On the Size of Reactive Plans. AAAI/IAAI, Vol. 2 1996 : 1182-1187 4 Peter Jonsson, Christer Bäckström : A Linear-Programming Approach to Temporal Reasoning. AAAI/IAAI, Vol. 2 1996 : 1235-1240 3 Peter Jonsson, Thomas Drakengren , Christer Bäckström : Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. KR 1996 : 352-363 2 Christer Bäckström , Peter Jonsson: Planning with Abstraction Hierarchies can be Exponentially Less Efficient. IJCAI 1995 : 1599-1605 1 Peter Jonsson, Christer Bäckström : Tractable Planning with State Variables by Exploiting Structural Restrictions. AAAI 1994 : 998-1003  DiSC'03 © 2003 Association for Computing Machinery |
