A practical analysis of non-termination in large logic programs
From MaRDI portal
Recommendations
Cites work
- An analysis of loop checking mechanisms for logic programs
- An overview of Ciao and its design philosophy
- Automated termination analysis for logic programs with cut
- HiLog: A foundation for higher-order logic programming
- Logical foundations of object-oriented and frame-based languages
- Termination proofs for logic programs with tabling
- The language features and architecture of B-Prolog
- The YAP prolog system
- XSB: extending Prolog with tabled logic programming
Cited in
(8)- Terminating evaluation of logic programs with finite three-valued models
- Non-termination Analysis of Logic Programs Using Types
- Non-termination analysis of logic programs with integer arithmetics
- Termination of logic programs: the never-ending story
- Checking termination of bottom-up evaluation of logic programs with function symbols
- A new approach to non-termination analysis of logic programs
- Non-termination Checking for Imperative Programs
- Static Analysis
This page was built for publication: A practical analysis of non-termination in large logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398306)