We introduce the problem of aggregating the individual goals of a group of agents to find a collective decision. Goals are represented by propositional formulas on a finite set of binary issues. We define some rules for carrying out the aggregation of goals and we show how to adapt axiomatic properties from the literature on Social Choice Theory to this setting. The type of problems we are interested in studying for our rules are axiomatic characterizations, as well as the computational complexity of computing the outcome.