摘 要: | It is well-known that there are circumstances where applying Reiter's closed world assump-tion (CWA) will lead to logical inconsistencies . In this paper, a new characterization of theCWA consistency is pesented and an algorithm is proposed for determining whether a datalase with-out function symbols is consistent with the CWA. The algorithm is shown to be efficient.
|