Given a 2HornSAT problem. Its possible in linear time to find the minimum solution to the problem i.e. that has minimum number of variables set to 1 in the solution.Now let us consider another variant of the problem:Given a positive integer K, is there a solution to the 2HornSAT such that exactly K variables are set to 1?Is this problem NP-Complete. I am struggling with its reduction but it seems this might be difficult. 
2HornSAT with exact cardinality?
complexity theory;np complete