{'fraction_non_alphanumeric': 0.030165912518853696, 'fraction_numerical': 0.0, 'mean_word_length': 4.724137931034483, '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}}
Modeling adversary scheduling with QCSP+

We consider cumulative scheduling problems in the presence of an adversary. In such setting the scheduler tries to manage the available resources in so as to meet the scheduling deadline, while the adversary is allowed to change some parameters---like the resource consumption of some tasks---up to a certain limit. We ask whether a robust schedule exists, i.e., one that is guaranteed to work whatever (malicious) actions the opponent may take. We propose to model this family of decision problems using a variant of Quantified Constraint Satisfaction Problems called QCSP+, and to solve them by using the solver QeCode.