31. Truth and falsity are grounded on the notion of'satisfiability of a formula by a team '. 32. A labeling literal over a set of variables enforces a satisfiability check of the constraints over these variables. 33. The satisfiability problem for all the logics introduced is NP-complete for all the modal logics considered. 34. PAL is model checking problem is solvable in polynomial time and its satisfiability problem is PSPACE-complete. 35. Satisfiability , or " SAT, " problems belong to a class mathematicians call NP-complete.36. The Boolean satisfiability problem is one of many such "'NP "'- complete problems. 37. Skolemization works by applying a second-order equivalence in conjunction to the definition of first-order satisfiability . 38. By the above equivalence, this is the same as the satisfiability of \ forall x \ exists y. 39. The first use of the labeling literal is to actual check satisfiability or partial satisfiability of the constraint store. 40. The first use of the labeling literal is to actual check satisfiability or partial satisfiability of the constraint store.
