{'fraction_non_alphanumeric': 0.014705882352941176, 'fraction_numerical': 0.007352941176470588, 'mean_word_length': 5.337209302325581, '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 situation-theoretic account of nonmonotonic reasoning

Situation theory in the sense of Barwise and Perry (1983) and nonmonotonic reasoning have been relatively disparate research programs in AI, the former focusing on computational approaches to natural language processing while the latter has been extensively used as a basic architecture for rational agents. The aim of the present paper is to suggest one way that these two approaches might fit together. Specifically, a situation semantics is given for a system of defeasible reasoning.