In this paper we develop a declarative language for modular answer set programming (ASP). Our language allows to declaratively state how one ASP module can import processed answer sets from another ASP module. We define the syntax and semantics of our language and illustrate its applicability by modeling the ACC tournament scheduling problem. Besides the elegance of developing declarative programs in a modular manner, our illustration shows that a problem that is not timely solvable when done in a monolithic way, but becomes solvable when done in a modular way.