The authors observe that a constraint of relevance should be used in determining which counterfactual conditionals are true. They thus combine the Routley-Meyer approach to relevant logic with selection functions for conditionals and obtain thereby a complete semantics for a family of conditional logics, including their base conditional relevant logic ConR as well as the counterfactual one, CountR, which are all free from fallacies of relevance.