Termination proofs of well-moded logic programs via conditional rewrite systems
From MaRDI portal
Recommendations
- Transformational methodology for proving termination of logic programs
- scientific article; zbMATH DE number 408800
- Termination of logic programs: Transformational methods revisited
- Automated termination proofs for logic programs by term rewriting
- On modular termination proofs of general logic programs
Cites work
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- Order-sorted completion: The many-sorted way
Cited in
(11)- Use of logical models for proving infeasibility in term rewriting
- Logicality of conditional rewrite systems
- scientific article; zbMATH DE number 4092824 (Why is no real title available?)
- scientific article; zbMATH DE number 408800 (Why is no real title available?)
- Termination of well-moded programs
- CLP(\(\mathsf{H}\)): constraint logic programming for hedges
- scientific article; zbMATH DE number 879005 (Why is no real title available?)
- Conditional term rewriting and first-order theorem proving
- Conditional rewriting logic: Deduction, models and concurrency
- Rewriting Techniques and Applications
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
This page was built for publication: Termination proofs of well-moded logic programs via conditional rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881206)
