15-816 Linear Logic
Lecture 12: Resource Management
Search in linear logic is severely complicated by the fact
that we have to distribute linear hypotheses between premises
in some of the rules. Guessing such a split is infeasible
so other methods have to be devised. A simple and general method
is to use boolean constraints to encode the relationships between
linear hypotheses. This technique which is due to Harland
and Pym [HP01], works for a variety of substructural logics.
Other, more specific forms of resource management
can be devised to work with specific search strategies.
James Harland and David Pym.
Resource-Distribution via Boolean Constraints.
Draft paper, August 2001.
An earlier version appeared in: Proceedings of the 14th International
Conference on Automated Deduction (CADE-14), W. McCune, editor,
Springer-Verlag LNAI 1249, Townsville, Australia, July 1997.