A Goal-independent Constraint-based Correct Partial Answers Semantics for Prolog with Cut

摘要

When programming in Prolog language, the information on the correct partial answers of goals is useful for the static analysis of Prolog programs. We propose a constraint-based correct partial answers semantics for Prolog, which deals with the control rules of Prolog and cut operator. This semantics is obtained as an abstraction of the decorated tree semantics proposed in and is designed with the aim to serve as a base for correct partial answers analysis of Prolog programs. P. Cousot's theory of abstract interpretation was used to prove the correctness of the semantics.