{'fraction_non_alphanumeric': 0.010309278350515464, 'fraction_numerical': 0.0, 'mean_word_length': 5.5675675675675675, '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}}
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans

This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution that subsumes conflict handling in classical nonlinear planners. By relaxing the restrictions, we develop a more general concept of conflicts suggesting practical and theoretical limitations of conflict handling in nonlinear plans.