{'fraction_non_alphanumeric': 0.025423728813559324, 'fraction_numerical': 0.0, 'mean_word_length': 5.080882352941177, '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}}
ABox Abduction in Description Logic

In this thesis we elaborate on logic-based automated reasoning techniques for abduction, driven by the principle of goal-oriented reasoning. In the first part we develop two variants of a computational framework for abduction in propositional logic, based on regular connection tableaux and resolution with set-of-support. The procedures are proven to be sound and complete calculi for finding consistent, minimal and relevant solutions to abductive problems. In the second part we adapt the framework to the Description Logic ALC. We obtain a procedure for solving ABox abduction problems (i.e. abductive problems whose main part of the input and every solution are specified by a set of ABox assertions), for which we prove the results of (plain) soundness and (minimality) completeness.