Termination of simply moded logic programs with dynamic scheduling

DOI10.1145/1013560.1013564zbMATH Open1367.68028OpenAlexW2154930848WikidataQ130892406 ScholiaQ130892406MaRDI QIDQ5277705FDOQ5277705

Authors: Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus 

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1013560.1013564

Recommendations

• scientific article; zbMATH DE number 1692954
• Termination of simply-moded well-typed logic programs under a tabled execution mechanism
• Reasoning in Dynamic Logic about Program Termination
• Logic Programming
• A dynamic approach to characterizing termination of general logic programs
• Termination of logic programs with delay declarations
• Inferring non-suspension conditions for logic programs with dynamic scheduling
• Termination of constraint logic programs
• Proving correctness of constraint logic programs with dynamic scheduling

zbMATH Keywords

dynamic schedulingterminationlogic programssimply moded

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cited In (5)

• Properties of Input-Consuming Derivations
• Title not available (Why is that?)
• A novel derivation framework for definite logic program
• Logic Programming
• Program Development in Computational Logic

This page was built for publication: Termination of simply moded logic programs with dynamic scheduling

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