{'fraction_non_alphanumeric': 0.029792746113989636, 'fraction_numerical': 0.0, 'mean_word_length': 5.134920634920635, '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}}
A Logical Encoding of Well-Founded Semantics with Explicit Negation

In this work we revisit a previously obtained logical characterization of Well-Founded Semantics (WFS) and show now its application to Alferes and Pereira’s WFS variant (WFSX) for programs with explicit negation. In a previous work, we presented a full logical treatment of program connectives by interpreting them in an intermediate logic (we called two-dimensional here-and-there, HT ). This logic acted as a monotonic basis on which an additional models minimization policy yielded the well-founded model (under WFS). The result presented in this paper shows that, by a suitable translation of rules with explicit negation into HT, WFSX is obtained by applying the same models minimization criterion.