{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0, 'mean_word_length': 5.286624203821656, '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}}
Parallelism in Abductive Logic Programming

Logic Programming has been recently extended to include abduction as an inference mechanism leading to the development of Abductive Logic Programming (ALP). In this work we study the introduction of parallelism in the operational behaviour of an abductive logic program. In particular, we examine the exploitation of various forms of parallelism (OR-parallelism, independent as well as dependent AND-parallelism) in an abductive logic program. The purpose of this work is twofold: i) to propose a model for parallel computation of abduction in ALP and to derive execution strategies that are more effective than sequential ones, ii) to find ways to use the existing technology developed over the years in parallelising deductive logic programming in the framework of abductive logic programming. The ideas described in the paper have been tested by means of an interpreter built over a concurrent logic language and the results are promising.