PAL is complete , its model checking problem is solvable in polynomial time and its satisfiability problem is PSPACE-decidable .
PAL is decidable , its model checking problem is solvable in polynomial time and its satisfiability problem is PSPACE-complete .