{'fraction_non_alphanumeric': 0.016159695817490494, 'fraction_numerical': 0.0, 'mean_word_length': 5.973509933774834, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Constraint-Based Envelopes over Multiple Alternatives

Many real-world planning problems require sophisticated reasoning about numeric resources, including sharing of resources by different actions. Constraintbased planners offer machinery to represent complex constraints and dependencies between actions. However, such planners usually consider a single partial plan at a time, and limit themselves with finding a feasible solution. Alternatively, planning graph based planners use an aggregate data structure over multiple partial plans to guide search, which allows such planners to guarantee optimality of the solution. Typically, such planners restrict the form of supported resource expressions. In this paper we describe a planner for construction of computational grid workflows that combines these approaches. Our planner uses an envelope over multiple execution sequences represented by a constraint network to drive the search towards a good solution, while supporting expressive models for resource sharing and multi-resource reservations.