Classes of terminating logic programs

DOI10.1017/S1471068402001400MaRDI QIDQ4452620zbMATH OpenOpenAlexFDO

Authors Dino Pedreschi, Jan-Georg Smaus, Salvatore Ruggieri

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

zbMATH Keywords

controldynamic schedulingleft-terminationlevel mappinglogic programnormselection ruleuniversal termination

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Program Development in Computational Logic
• Strong termination of logic programs
• Termination of logic programs: the never-ending story
• Logic Programming
• Proving termination of general Prolog programs

Cited in

(11)

• On logic programs that always succeed.
• Bounds in the propagation of selection into logic programs
• Terminating evaluation of logic programs with finite three-valued models
• scientific article; zbMATH DE number 4191092 (Why is no real title available?)
• Logic + control: on program construction and verification
• Termination of logic programs with delay declarations
• Contextual hypotheses and semantics of logic programs
• Program Development in Computational Logic
• -Universal termination of logic programs
• Making assumptions in the automated derivation
• Termination of floating-point computations

This page was built for publication: Classes of terminating logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452620)