Finding Minimal Cover Set

Given a description of a database, I’m asked to find a suitable FDs, then find the minimal cover set of all the FDs and then design a relational schema.

My question is;
Say i came up with these FDs, FD = {FD_1, …, FD_n}.
Then now when finding the minimal cover set of F, should i consider the (PK, Fk) FDs with them?
That’s say i have foreign keys FDs such as, FK = {FK_1,…,FK_m}.
When finding the minimal cover set, should i consider (FD ⋃ FK) to work on or just work on the FD set? and why?

Go to Source
Author: Moosmir