{'fraction_non_alphanumeric': 0.025032938076416336, 'fraction_numerical': 0.0, 'mean_word_length': 5.38655462184874, '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}}
Abduction in (Probabilistic) Answer Set Programming

Answer Set Programming (ASP) is a branch of Logic Programming particularly useful for representing complex domains. Logic abduction, the reasoning strategy that deals with incomplete data, is tightly related to ASP, and encodes incompleteness through abducibles. The goal of logic abduction is to find the minimal set of abducibles (where minimality is usually considered in terms of set inclusion) that explains a query. Recently, abductive reasoning has been introduced in the context of Probabilistic Logic Programming, but no solutions are available for Probabilistic Answer Set Programming (PASP). In this paper, we close this gap and propose an algorithm to perform abduction both in ASP and in PASP.