Pages that link to "Item:Q5738911"
From MaRDI portal
The following pages link to Termination proofs for logic programs with tabling (Q5738911):
Displaying 8 items.
- Terminating tableau systems for hybrid logic with difference and converse (Q1047795) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- (Q2766778) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Proof of Correctness of Decision Table Programs (Q3321425) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- A practical analysis of non-termination in large logic programs (Q5398306) (← links)