@inproceedings{b78ccb72ad864e63850ac9c101c13e07,
title = "Detecting determinacy in prolog programs",
abstract = "In program development it is useful to know that a call to a Prolog program will not inadvertently leave a choice-point on the stack. Determinacy inference has been proposed for solving this problem yet the analysis was found to be wanting in that it could not infer determinacy conditions for programs that contained cuts or applied certain tests to select a clause. This paper shows how to remedy these serious deficiencies. It also addresses the problem of identifying those predicates which can be rewritten in a more deterministic fashion. To this end, a radically new form of determinacy inference is introduced, which is founded on ideas in ccp, that is capable of reasoning about the way bindings imposed by a rightmost goal can make a leftmost goal deterministic.",
author = "Andy King and Njin Lu and Samir Genaim",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11799573\_12",
language = "English",
isbn = "9783540366355",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "132--147",
booktitle = "Logic Programming - 22nd International Conference, ICLP 2006, Proceedings",
address = "Germany",
note = "22nd International Conference on Logic Programming, ICLP 2006 ; Conference date: 17-08-2006 Through 20-08-2006",
}