2011/09/12 by Jael Kriener, Kriener, Jael, Andy King +1
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Natural Language Processing Techniques #Programming Languages (cs.PL) #Software Engineering Research
paper · pdf · doi:10.48550/arxiv.1109.2548
openalex publication_date 2011/09/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.