<s>
Satplan	B-Application
(	O
better	O
known	O
as	O
Planning	O
as	O
Satisfiability	O
)	O
is	O
a	O
method	O
for	O
automated	B-Application
planning	I-Application
.	O
</s>
<s>
It	O
converts	O
the	O
planning	O
problem	O
instance	O
into	O
an	O
instance	O
of	O
the	O
Boolean	B-Algorithm
satisfiability	I-Algorithm
problem	I-Algorithm
,	O
which	O
is	O
then	O
solved	O
using	O
a	O
method	O
for	O
establishing	O
satisfiability	O
such	O
as	O
the	O
DPLL	B-Application
algorithm	I-Application
or	O
WalkSAT	B-Application
.	O
</s>
<s>
This	O
is	O
similar	O
to	O
simulation	O
of	O
Turing	B-Architecture
machines	I-Architecture
with	O
the	O
satisfiability	B-Algorithm
problem	I-Algorithm
in	O
the	O
proof	O
of	O
Cook	O
's	O
theorem	O
.	O
</s>
