Resource-Distribution via Boolean Constraint (Extended Abstract)


Proof-search (the basis of logic programming) with multiplicative inference rules, such as linear logic's R and OL, is problematic because of the required non-deterministic splitting of resources. Similarly , searching with additive rules such as NL and R requires a non-deterministic choice between two formulae. Many strategies which resolve such non… (More)
DOI: 10.1007/3-540-63104-6_21


  • Presentations referencing similar topics