A methodology for proving termination of logic programs
From MaRDI portal
Publication:4306397
DOI10.1016/0743-1066(94)90004-3zbMATH Open0811.68069OpenAlexW2041937391WikidataQ127124396 ScholiaQ127124396MaRDI QIDQ4306397FDOQ4306397
Publication date: 19 September 1994
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(94)90004-3
Recommendations
Cited In (20)
- Program Development in Computational Logic
- Reasoning about termination of pure Prolog programs
- A dynamic approach to characterizing termination of general logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reasoning in Dynamic Logic about Program Termination
- Termination of logic programs: Transformational methods revisited
- A semantic basis for the termination analysis of logic programs
- A proof-theoretic study of abstract termination principles
- Transformational methodology for proving termination of logic programs
- A context-based approach to proving termination of evaluation
- Automated termination analysis for logic programs with cut
- Proving termination of general Prolog programs
- Title not available (Why is that?)
- Strong termination of logic programs
- Termination of logic programs: the never-ending story
- A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4
- Input-Termination of Logic Programs
- Proving Termination Using Recursive Path Orders and SAT Solving
This page was built for publication: A methodology for proving termination of logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4306397)