King, Andy and Lu, L. and Genaim, S.
Determinacy Inference by Suspension Inference.
, University of Kent
The aim of determinacy inference is to infer a class of calls to a given logic program, for which execution will generate at most one answer and generate the answer only once. Two serious impediments to accurate determinacy inference are: (1) the way bindings imposed by a rightmost goal can make a leftmost goal deterministic; (2) the way determinacy is often enforced with cut. Rather surprisingly, this paper shows how: problem (1) can be tackled by recasting determinacy inference as a problem in concurrency; problem (2) can be addressed within this concurrency framework. Experimental evaluation shows that the new analysis can infer richer classes of deterministic calls for many programs.
- Depositors only (login required):