A New Semantics for Logic Programs

In this paper we propose a novel semantics for logic programs in the situation calculus. One of the advantages of our proposal is that like Clark’s completion semantics, it is explicitly formulated in classical logic. For this reason, it is suitable for proving properties of logic programs such as the correctness of various program transformation operators.