Efficient Analysis of Logic Programs with Dynamic Scheduling

The first logic programming languages used a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-toright but some calls are dynamically “delayed” until their arguments are sufficiently instantiated. We give a new framework for the global analysis of logic programming languages with dynamic scheduling which is based on approximating the delayed atoms by a closure operator. We give an example analysis for groundness based on this framework, and give the results of an implementation which demonstrates the method is practical