The Helly property and satisfiability of Boolean formulas defined on set families

In this paper, we study the problem of satisfiability of Boolean formulas @f in conjunctive normal form (CNF) whose literals have the form v@?S and express the membership of values to sets S of a given set family S defined on a finite domain D. We establish the following dichotomy result. We show that checking the satisfiability of such formulas (called S-formulas) with three or more literals per clause is NP-complete except the trivial case when the intersection of all sets in S is nonempty. On the other hand, the satisfiability of S-formulas @f containing at most two literals per clause is decidable in polynomial time if S satisfies the Helly property, and is NP-complete otherwise (in the first case, we present an O(|@f|@?|S|@?|D|)-time algorithm for deciding if @f is satisfiable). Deciding whether a given set family S satisfies the Helly property can be done in polynomial time. We also overview several well-known examples of Helly families and discuss the consequences of our result to such set families and its relationship with the previous work on the satisfiability of signed formulas in multiple-valued logic.