Gradual semantics are now well-studied in the computational argumentation literature. In this paper, we argue that gradual semantics that can handle both bipolarity (e.g. attacks and supports) and sets of attacking arguments (i.e. several arguments together attacking an argument) might be useful in some contexts. We define the formal framework and properties for such semantics. We proceed by adapting, studying and implementing three well-known semantics from the bipolar gradual literature to this new framework.