Proving correctness and completeness of normal programs – a declarative approach

DOI10.1017/S147106840500253XzbMath1083.68018OpenAlexW2126250701MaRDI QIDQ5715449

Włodzimierz Drabent, Mirosława Miłkowska

Publication date: 3 January 2006

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s147106840500253x

zbMATH Keywords

completenessdeclarative programmingprogram correctness

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (7)

Correctness and Completeness of Logic Programs ⋮ On Completeness of Logic Programs ⋮ On Correctness and Completeness of an n Queens Program ⋮ On correctness of normal logic programs ⋮ Logic + control: On program construction and verification ⋮ A simple correctness proof for magic transformation ⋮ Proving completeness of logic programs with the cut

This page was built for publication: Proving correctness and completeness of normal programs – a declarative approach