Logic + control: On program construction and verification. Issue 1 (19th June 2017)

• Record Type: Journal Article
• Authors: DRABENT, WŁODZIMIERZ
• Is Part Of: Theory and practice of logic programming. Volume 18:Issue 1(2018)
• Page Start: 1
• Page End: 29
• Publication Date: 2017-06-19
• Subjects: logic programming, -- declarative programming, -- program completeness, -- program correctness, -- specification, -- program transformation, -- floundering, -- occur-check; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068417000047
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: This paper presents an example of formal reasoning about the semantics of a Prolog program of practical importance (the SAT solver of Howe and King). The program is treated as a definite clause logic program with added control. The logic program is constructed by means of stepwise refinement, hand in hand with its correctness and completeness proofs. The proofs are declarative – they do not refer to any operational semantics. Each step of the logic program construction follows a systematic approach to constructing programs which are provably correct and complete. We also prove that correctness and completeness of the logic program is preserved in the final Prolog program. Additionally, we prove termination, occur-check freedom and non-floundering. Our example shows how dealing with "logic" and with "control" can be separated. Most of the proofs can be done at the "logic" level, abstracting from any operational semantics. The example employs approximate specifications; they are crucial in simplifying reasoning about logic programs. It also shows that the paradigm of semantics-preserving program transformations may be not sufficient. We suggest considering transformations which preserve correctness and completeness with respect to an approximate specification.