f (s) = {s ∪ m | m ∈ T (V M · D M )} for all s ∈ S1.

21

C. Bäckström and P. Jonsson

Artiﬁcial Intelligence 302 (2022) 103608

Table 1
Properties of the planning abstraction methods.

Type of 
method

ABS
VP
VDA
RRAa/RRAb
GIDL
DLBS

Properties

Theorems 42 & 43
R(cid:14)C(cid:14)
M↑R(cid:14)C(cid:14)
M↑R(cid:14)C(cid:14)
M(cid:14)R↓C(cid:14)
M(cid:14)R(cid:14)
M↓R(cid:14)C(cid:14)

Theorem 44
P1↓, P1↑
P1↓, PS↑
P1↓, PS↑
PS↓
–
PS↓, P1↑

Theorem 45
not PL↓, P↑, not PS↑
not PL↓
not PL↓
PS↑
not P1↓, not P1↑
PW↑, not P↑
A-framework-for-analysing-state-abstraction-metho_2022_Artificial-Intelligen