Defaults as Generalized Quantifiers

Abstract

We interpret (open normal) defaults as generalized first-order logic-quantifiers, and give a semantics and a corresponding sound and complete axiom system. Nested and negated defaults are admissible and have a clear meaning. Moreover, the logic provides a notion of consistency for default theories, which is used for a theory revision approach in an order-sorted language.