Correctness and completeness of logic programs release_32mo5fm6ljfjpmtsdealwo4lbe

by Włodzimierz Drabent

Released as a article .

2015  

Abstract

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 which 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 approximate specifications eliminate a major drawback of the latter. We argue that our proof methods reflect natural declarative thinking about programs, and that they can be used, formally or informally, in every-day programming.
In text/plain format

Archived Files and Locations

application/pdf  661.2 kB
file_wz2aw7adqfg5jc7pmjwltlh37y
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2015-05-17
Version   v2
Language   en ?
arXiv  1412.8739v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d61ff600-78b0-4ce7-b8b2-c0f8f37ef0e7
API URL: JSON