72 citations · 130 across the 27 of their papers we have counts for
7 papers · 1 filter
Solving Infinite-Domain CSPs Using the Patchwork Property
Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak +1
The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI su…
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
Christer Bäckström, Peter Jonsson
The causal graph of a planning instance is an important tool for planning both in practice and in theory. The theoretical studies of causal graphs have largely analysed the computa…
Algorithms and Limits for Compact Plan Representations
Christer Bäckström, Peter Jonsson
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit re…
A Complete Parameterized Complexity Analysis of Bounded Planning
Christer Baeckstroem, Peter Jonsson, Sebastian Ordyniak +1
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions. Given its difficu…
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Baeckstroem, Yue Chen, Peter Jonsson +2
The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following res…
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time
T. Drakengren, P. Jonsson
This paper combines two important directions of research in temporal resoning: that of finding maximal tractable subclasses of Allen's interval algebra, and that of reasoning with…