{'fraction_non_alphanumeric': 0.024150268336314847, 'fraction_numerical': 0.005366726296958855, 'mean_word_length': 5.016129032258065, '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}}
Semantical Foundation of Extended Generalized Logic Programs

We present a deenition of stable generated models for extended generalized logic programs (EGLP) which a) subsumes the deenition of stable models for normal logic programs of GL88], and is sound with respect to the answer set semantics for extended disjunctive programs of GL91]. and b) does not refer to negation-as-failure by allowing for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any speciic connective, nor on any speciic syntax of rules). This notion was investigated for generalized logic programs in HW97]. The intuition underlying our notion of stable generatedness is the property of groundedness which captures the concept of rule-governed generation of factual knowledge. Stable generated models of S can be understood as particular grounded models generated by a stable S-grounded chain. An important subclass of EGLP are the ampliative generalized logic programs (GLP +) containing ampliative rules only. It turns out that every ampliative generalized logic program has a grounded model.