This paper introduces a novel parametric family of semantics for abstract argumentation called resolution-based and analyzes in particular the resolution-based version of the traditional grounded semantics, showing that it features the unique property of satisfying a set of general desirable properties recently introduced in the literature. Additionally, an investigation of its computational complexity properties reveals that resolution-based grounded semantics is satisfactory also from this perspective.