{'fraction_non_alphanumeric': 0.014553014553014554, 'fraction_numerical': 0.0, 'mean_word_length': 5.551020408163265, '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}}
Efficient recursive aggregate evaluation in logic programming

Answer Set Programming (ASP) is a powerful formalism for knowledge representation and common sense reasoning, particularly suitable for representing incomplete knowledge and nonmonotonic reasoning. ASP is used in Artificial Intelligence applications such as diagnosis and planning. Aggregate functions are an important extension to ASP that allow the representation of concepts involving sets of data in a natural way. We have analyzed the properties of recursive aggregates, identified rich classes of programs with a unique answer set, and defined a new notion of unfounded set that we used in answer set computations. Experimental results on the implemented prototype, obtained by extending DLV, show a significant performance improvement of our enhanced approach over existing techniques. In this paper we summarize some of our results, which are fully described in the thesis of the same title.