On correctness of normal logic programs
From MaRDI portal
Recommendations
Cites work
- A kripke-kleene semantics for logic programs*
- Bilattices and the semantics of logic programming
- Completeness of SLDNF-resolution for nonfloundering queries
- Correctness and completeness of logic programs
- scientific article; zbMATH DE number 3947593 (Why is no real title available?)
- scientific article; zbMATH DE number 956484 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 49478 (Why is no real title available?)
- scientific article; zbMATH DE number 708499 (Why is no real title available?)
- Logic + control: on program construction and verification
- Logic programming and negation: A survey
- Negation in logic programming
- Proof method of partial correctness and weak completeness for normal logic programs
- Proving correctness and completeness of normal programs – a declarative approach
- Strict completion of logic programs
- What is failure? An approach to constructive negation
Cited in
(4)- A new machine-checked proof of strong normalisation for display logic
- scientific article; zbMATH DE number 4199606 (Why is no real title available?)
- scientific article; zbMATH DE number 2085282 (Why is no real title available?)
- Acceptable propositional normal logic programs checking procedure implementation
This page was built for publication: On correctness of normal logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103020)