充足可能性問題
Horn-satisfiability is P-complete. It can be seen as P's version of the Boolean satisfiability problem.