Coalition formation is an important form of cooperation in multiagent systems. A series of frameworks for coalition formation have been designed,to some extent, which solves many important questions, such as the maximization of the sum of values of all coalitions, task allocation, combinatorial auctions, and so on.In their systems, the agents which form coalition are driven by interests or accomplishing tasks, which is helpless in supervising the participators in the system. Therefore, investigating the process of coalition formation from the aspect of restriction is necessary. We analyse the restriction problem in coalition formation, and then use proposition logic to describe the restriction of agents. Firstly, we design the coalition preference language(CPL), and describe its semantics. Secondly, we present some properties of CPL. Finally, we compare coalition formation under dynamic restrictions with some familiar frameworks of coalition formation, and educe the advantages of ours.