Pages that link to "Item:Q1105352"
From MaRDI portal
The following pages link to Inductive assertion method for logic pograms (Q1105352):
Displaying 9 items.
- Weakest preconditions for pure Prolog programs (Q293340) (← links)
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Norms on terms and their use in proving universal termination of a logic program (Q1318707) (← links)
- Reasoning about prolog programs: From modes through types to assertions (Q1346766) (← links)
- On the verification of finite failure (Q2575838) (← links)
- On definite program answers and least Herbrand models (Q4593038) (← links)
- A simple correctness proof for magic transformation (Q4897705) (← links)
- The Prolog Debugger and Declarative Programming (Q5097636) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
