RedAlert: Determinacy inference for Prolog

DOI10.1017/S1471068411000160MaRDI QIDQ3087441zbMATH OpenFDO

Authors Jael Kriener, Andy King

Publication date 16 August 2011

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

Full work available at URL https://arxiv.org/abs/1109.2548

zbMATH Keywords

abstract interpretationbackwards analysisBoolean formulaeconstraintscutdeterminacy inferenceProlog

Mathematics Subject Classification ID

Logic programming (68N17)

Abstract: This paper revisits the problem of determinacy inference addressing the problem of how to uniformly handle cut. To this end a new semantics is introduced for cut, which is abstracted to systematically derive a backward analysis that derives conditions sufficient for a goal to succeed at most once. The method is conceptionally simpler and easier to implement than existing techniques, whilst improving the latter's handling of cut. Formal arguments substantiate correctness and experimental work, and a tool called 'RedAlert' demonstrates the method's generality and applicability.

Recommendations

• Detecting Determinacy in Prolog Programs
• Programming Languages and Systems
• scientific article; zbMATH DE number 516993
• Sequence-based abstract interpretation of Prolog
• Semantics for Prolog with cut -- revisited

Cited in

(4)

• Correct reasoning about logic programs
• Programming Languages and Systems
• Detecting Determinacy in Prolog Programs
• A semantics-based determinacy analysis for Prolog with cut

This page was built for publication: RedAlert: Determinacy inference for Prolog

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