{'fraction_non_alphanumeric': 0.012259194395796848, 'fraction_numerical': 0.0, 'mean_word_length': 5.079787234042553, '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 Databases Technology for Polynomial Models Diagnosis

Model-based Diagnosis allows the identification of the parts which fail in a system. The models are based on the knowledge of the system to diagnose, and they can be represented by constraints associated to the components. The variables including in these constraints can be observable or non-observable, depending on the situation of sensors. In order to obtain the minimal diagnosis in a system, an important issue is related to find out the minimal possible conflicts in an efficient way. We consider that Constraint Databases represent an excellent approach in order to solve this problem in complex systems, where a tuple in a relational database could be replaced by a conjunction of constraints. In this work we have used a novel logical architecture of Constraint Databases which has allowed us to obtain these possible minimal conflicts by means of a standard query language though the information is stored in a conventional relational database. Moreover, we have considered Gröbner bases as a projection operator to obtain the minimal possible conflicts of a system.