On modular termination proofs of general logic programs
From MaRDI portal
Publication:4452617
Recommendations
Cited in
(14)- scientific article; zbMATH DE number 7204561 (Why is no real title available?)
- Termination Analysis of Logic Programs Based on Dependency Graphs
- Termination proofs for logic programs with tabling
- Automated modular termination proofs for real Prolog programs
- scientific article; zbMATH DE number 6606377 (Why is no real title available?)
- scientific article; zbMATH DE number 1149425 (Why is no real title available?)
- scientific article; zbMATH DE number 1926607 (Why is no real title available?)
- Termination prediction for general logic programs
- scientific article; zbMATH DE number 1973218 (Why is no real title available?)
- Program Development in Computational Logic
- Proving termination of general Prolog programs
- Termination proofs of well-moded logic programs via conditional rewrite systems
- scientific article; zbMATH DE number 3924108 (Why is no real title available?)
- Use of logical models for proving operational termination in general logics
This page was built for publication: On modular termination proofs of general logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452617)