Pages that link to "Item:Q4036282"
From MaRDI portal
The following pages link to Strong termination of logic programs (Q4036282):
Displaying 14 items.
- Proving completeness of logic programs with the cut (Q511027) (← links)
- Left termination turned into termination (Q1318730) (← links)
- Undecidable goals for completed acyclic programs (Q1326578) (← links)
- A logical semantics for depth-first Prolog with ground negation (Q1390936) (← links)
- Loop checking in SLD-derivations by well-quasi-ordering of goals (Q1575249) (← links)
- Negation as failure for disjunctive logic programming (Q1924818) (← links)
- Totally correct logic program transformations via well-founded annotations (Q2271905) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- On Completeness of Logic Programs (Q2949713) (← links)
- Logic + control: On program construction and verification (Q4603427) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- \(\exists\)-Universal termination of logic programs (Q5940923) (← links)
- On Correctness and Completeness of an <i>n</i> Queens Program (Q6063871) (← links)
