Linearity Constraints as Bounded Intervals in Linear Logic Programming

Abstract

We present a new system of resource management for linear logic programming which ensures linearity constraints are satisfied solely by manipulating individual formula tags. In our system, tags are rational numbers, and a single bounded interval suffices to characterize all of the available formulas at any point in the proof. This system, which we prove correct directly with respect to the efficient resource management system of Cervesato et al., simplifies and improves upon the tag-frame system of Hodas et al.