Proving completeness of logic programs with the cut
From MaRDI portal
Publication:511027
DOI10.1007/s00165-016-0392-0zbMath1355.68033arXiv1602.08778OpenAlexW2289914401MaRDI QIDQ511027
Publication date: 14 February 2017
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.08778
Related Items (2)
The Prolog Debugger and Declarative Programming ⋮ Logic + control: On program construction and verification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proof methods of declarative properties of definite programs
- Simple operational and denotational semantics for Prolog with cut
- Comparative semantics for prolog with cut
- Inductive assertion method for logic pograms
- Reasoning about termination of pure Prolog programs
- On Completeness of Logic Programs
- Automated termination analysis for logic programs with cut
- Strong termination of logic programs
- The witness properties and the semantics of the Prolog cut
- On definite program answers and least Herbrand models
- Operational and goal-independent denotational semantics for Prolog with cut
- Semantics for Prolog with Cut – Revisited
- Correctness and Completeness of Logic Programs
- Proving correctness and completeness of normal programs – a declarative approach
This page was built for publication: Proving completeness of logic programs with the cut
