On modular termination proofs of general logic programs

DOI10.1017/S1471068402001382zbMATH Open1087.68526MaRDI QIDQ4452617FDOQ4452617

Authors: Annalisa Bossi, Nicoletta Cocco, Sabina Rossi, Sandro Etalle 

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: http://journals.cambridge.org/action/displayIssue?jid=TLP&volumeId=2&issueId=03

Recommendations

• scientific article; zbMATH DE number 879005
• Termination proofs for logic programs with tabling
• Proving termination of general Prolog programs
• scientific article; zbMATH DE number 1149425
• Termination proofs for logic programs

zbMATH Keywords

verificationlogic programmingtermination

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (12)

• Title not available (Why is that?)
• Program Development in Computational Logic
• Termination proofs of well-moded logic programs via conditional rewrite systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Proving termination of general Prolog programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination prediction for general logic programs
• Title not available (Why is that?)
• Automated modular termination proofs for real Prolog programs

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)