So-called multiple nominative constructions (MNCs) in Korean are quite theoretically as well as computationally puzzling. This paper shows that a grammar allowing the interaction of declarative constraints on types of signs - in particular, constructions (phrases and clauses)-can provide a robust and efficient way of encoding generalizations for two different MNCs. The feasibility of the grammar developed has been checked with its implementation into the LKB (Linguistic Knowledge Building) system.