解决不一致性和不连贯性的限定语义

In default reasoning and answer set programming there may be only one trivial extension and answer set or no extension and answer set. We propose the restricted semantics for default reasoning and answer set programming to resolve the problems of inconsistency and incoherence. The restricted semantics is based on the four-value logic. We provide a transformation approach to compute the restricted four-valued extensions and answer sets by reducing them into classical ones. Our proposal can maintain both the expressiveness and reasoning ability of default reasoning and answer set programming.