Pages that link to "Item:Q5096221"
From MaRDI portal
The following pages link to Proving termination of general Prolog programs (Q5096221):
Displaying 7 items.
- A new SLDNF-tree (Q1199935) (← links)
- Reasoning about termination of pure Prolog programs (Q1308986) (← links)
- Norms on terms and their use in proving universal termination of a logic program (Q1318707) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- Inference of Termination Conditions for Numerical Loops in Prolog (Q2996199) (← links)
- (Q4386947) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)