Correctness and completeness of logic programs

  title={Correctness and completeness of logic programs},
  author={Wlodzimierz Drabent},
  journal={ACM Trans. Comput. Log.},
We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method that should be well known but is often neglected. Also, we show how to prove completeness and correctness in the presence of SLD-tree pruning, and point out that approximate specifications simplify specifications and proofs. We compare the proof methods to declarative diagnosis (algorithmic debugging), showing that… CONTINUE READING