Annotated Semantics for Nonmonotonic Reasonings in Artificial Intelligence Ⅳ

摘要

In this paper, We define an annotated logic AL for NF and CWA based on the set of truth values(annotations) in such a way that the structure is the 4-valued complete lattice(Lattice-4) and each annotation corresponds to each state in logic program derivation. We also propose two kinds of annotated completion formulas, which can be the declarative annotated semantics for NF and CWA as well as Clark's completion. Furthermore, we take a multi-agent system having a contradiction between each agent's world as a simple example and show how the annotated completion deals with such inconsistency.