We study the properties of optimal patterns, our novel extension of SPARQL, that allow for a finegrained control over incompleteness of query answers in knowledge graphs. Optimal patterns encode preferences over the completeness of query answers. In this paper, we add language constructs for expressing dependencies between conflicting preferences. Furthermore, we provide discussions and proofs of fundamental results concerning SPARQL with optimal patterns.