Highly Influenced

# Correctness and completeness of logic programs

@article{Drabent2016CorrectnessAC, title={Correctness and completeness of logic programs}, author={Wlodzimierz Drabent}, journal={ACM Trans. Comput. Log.}, year={2016}, volume={17}, pages={18:1-18:32} }

- Published 2016 in ACM Trans. Comput. Log.
DOI:10.1145/2898434

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