A {\it pattern} is a finite string consisting of constant symbols and variables.A pattern is {\it regular} if each variable appears in the pattern at most once.The language generated by a pattern is the set of constant strings obtained from the pattern by substituting nonempty strings for variables in the pattern. 
This paper deals with inclusion problems of unions or intersections of languages defined by regular patterns and co-regular patterns. 
The semantics of a co-pattern is defined by a particular subset of the complement of the original pattern language. 
We show the equivalence between the semantic inclusion and the syntactic inclusion.