{'fraction_non_alphanumeric': 0.037694013303769404, 'fraction_numerical': 0.0, 'mean_word_length': 4.7215189873417724, '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}}
A Goal-Directed Calculus for Standard Conditional Logics

In this paper we focus on proof methods for conditional logics. We present US’, a goal-directed calculus for the basic normal conditional logic CK and its standard extensions ID, MP, and ID+MP. US’ is derived from some labelled sequent calculi, called SeqS’, and it is based on the notion of uniform proofs. We also introduce GoalDUCK, a simple implementation of US’ written in SICStus Prolog.