An Algorithm for Determining Database Consistency Under the Closed World Assumption

It is well-known that there are circumstances where applying Reiter‘s closed world assumption(CWA)will lead to logical inconsistencies.In this paper,a new characterization of the CA consistency is pesented and an algorithm is proposed for determining whether a datalase without function symbols is consistent with the CWA.The algorithm is shown to be efficient.