scientific article; zbMATH DE number 1149425
From MaRDI portal
Publication:4386947
zbMATH Open0900.68135MaRDI QIDQ4386947FDOQ4386947
Authors: Elena Marchiori 
Publication date: 11 May 1998
Title of this publication is not available (Why is that?)
Recommendations
- A methodology for proving termination of logic programs
- scientific article; zbMATH DE number 176506
- Termination proofs for logic programs
- On modular termination proofs of general logic programs
- Proving termination of general Prolog programs
- scientific article; zbMATH DE number 408800
- Automated termination proofs for logic programs by term rewriting
- Program Development in Computational Logic
- Transformational methodology for proving termination of logic programs
Cited In (12)
- Reasoning about termination of pure Prolog programs
- A methodology for proving termination of logic programs
- A dynamic approach to characterizing termination of general logic programs
- Title not available (Why is that?)
- Reasoning in Dynamic Logic about Program Termination
- On modular termination proofs of general logic programs
- Termination of logic programs: Transformational methods revisited
- Transformational methodology for proving termination of logic programs
- Title not available (Why is that?)
- Proving termination of general Prolog programs
- Title not available (Why is that?)
- Strong termination of logic programs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4386947)
