{'fraction_non_alphanumeric': 0.015410958904109588, 'fraction_numerical': 0.0, 'mean_word_length': 5.882352941176471, '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}}
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation

In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, without necessarily being perfect. Such approximate reasoning can be used to exchange solution quality for computation time, known as anytime reasoning. In this paper we study approximate versions of diagnostic reasoning. Traditionally, diagnostic reasoning is characterised in terms of the logical entailment relation. In this pa