{'fraction_non_alphanumeric': 0.02079002079002079, 'fraction_numerical': 0.004158004158004158, 'mean_word_length': 5.734265734265734, '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}}
Identification of incompletely specified multiple-valued Kleenean functions

This paper focuses on incompletely specified multiple-valued Kleenean functions (1991). It is easy to verify that they do not have functional completeness in the class of all functions on the unit interval. Therefore, not all incompletely specified functions on the unit interval are incompletely specified multiple-valued Kleenean functions. In this paper, we will clarify a necessary and sufficient condition for an incompletely specified function to be an incompletely specified multiple-valued Kleenean function. Further, we show an algorithm which derives one of the logic formulas representing the incompletely specified multiple-valued Kleenean function. In considering the application of multiple-valued Kleenean functions, we will show an example which suggests the possibility that input-output data can be described abstractly in terms of multiple-valued Kleenean functions.