A Defeasible Logic for Clauses

Abstract

Abstract. A new non-monotonic logic called clausal defeasible logic (CDL) is defined and explained. CDL is the latest in the family of defeasible logics, which, it is argued, is important for knowledge representation and reasoning. CDL increases the expressive power of defeasible logic by allowing clauses where previous defeasible logics only allowed literals. This greater expressiveness allows the representation of the Lottery Paradox, for example. CDL is well-defined, consistent, and has other desirable properties.