We study the relations among various abstract domains for groundness analyses of logic programming. We re-construct Pos as a logical domain and prove that it is the optimal abstract domain for groundness analysis which can be constructed starting from the property of groundness by applying only logic operations.