Redundancy in Logic III: Non-Mononotonic Reasoning

TL;DR

This paper investigates the redundancy of circumscriptive and default theories, focusing on their complexity and implications for non-monotonic reasoning systems.

Contribution

It provides new results on the complexity of determining redundancy in non-monotonic logic theories, specifically circumscriptive and default theories.

Findings

Redundancy of theories can be computationally complex to establish.

Complexity results vary depending on the type of non-monotonic logic.

The paper advances understanding of the computational aspects of non-monotonic reasoning.

Abstract

Results about the redundancy of circumscriptive and default theories are presented. In particular, the complexity of establishing whether a given theory is redundant is establihsed.