Proving completeness of logic programs with the cut

February 28, 2016 ยท The Ethereal ยท ๐Ÿ› final version: Formal Aspects of Computing, 2017, 29(1),155-172

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Wล‚odzimierz Drabent arXiv ID 1602.08778 Category cs.LO: Logic in CS Cross-listed cs.PL Citations 0 Venue final version: Formal Aspects of Computing, 2017, 29(1),155-172 Last Checked 5 months ago
Abstract
Completeness of a logic program means that the program produces all the answers required by its specification. The cut is an important construct of programming language Prolog. It prunes part of the search space, this may result in a loss of completeness. This paper proposes a way of proving completeness of programs with the cut. The semantics of the cut is formalized by describing how SLD-trees are pruned. A sufficient condition for completeness is presented, proved sound, and illustrated by examples.
Community shame:
Not yet rated
๐Ÿ“„ View on arXiv ๐ŸŒ View on ar5iv ๐Ÿ“‘ PDF ๐ŸŽ‰ Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS