In multi-agent system, in order to describe the reasonable abilities of agents, people created the theory of coalition logic. In this theory the key word'coalition'means that groups of agents are assumed to share the same interests. Coalition logic of propositional control (CL-PC) is one of the most important coalition logics, which can formally describe the contingent ability of agents. Concretely, In CL-PC agents are each assumed to control a set of propositional variables, the powers of agents and coalitions then derive from the allocation of propositions to agents. Furthermore, the basic modal constructs in this language allow us to express the fact that a group of agents can cooperate to bring about a certain state of affairs, that means if every agent of this group makes his own choice, then no matter what the other agents do, the states of the system will be determined according to their wish.This paper enriches CL-PC system by adding some epistemic operators, and establishes a series of cooperative epistemic systems that are more extensive.Firstly, we give a complete and sound axiom system: KCL-PC, which introduces basic knowledge to the agents in CL-PC system.Secondly, we give a more expressable system ECL-PC, which is builded up by adding two common knowledge operators to KCL-PC system, and we will give a relatively rough model checking algorithm of ECL-PC.Futhermore, from the other point of knowledge - ignorance, we construct another epistemic system ICL-PC by introducing ignorance operator to CL-PC system, and we will give and prove some properties of this system.At last, from the point of game, we construct AL-PC system. In this system we study the relation between tactics and cooperation, we will also prove some properties of this system, of course a model checking algorithm is necessary. |