A Semantics for Conditionals with Default Negation
Ranking functions constitute a powerful formalism for nonmonotonic reasoning based on qualitative conditional knowledge. Conditionals are formalized defeasible rules and thus allow one to express that certain individuals or subclasses of some broader concept behave differently. More precisely, in order to model these exceptions by means of ranking functions, it is necessary to state that they behave contrarily with respect to the considered property. This paper proposes conditionals with default negation which instead enable a knowledge engineer to formalize exceptions without giving more specific information. This is useful when a subclass behaves indifferent towards a certain property, or the knowledge engineer wants to exclude a certain subclass because she is not aware of its behavior. Based on this novel type of conditionals, we further present and discuss a nonmonotonic inference formalism.
- 2.Clark, K.L.: Negation as Failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases. Springer, New York (1978)Google Scholar
- 4.Gelfond, M.: Answer sets. In: Lifschitz, V., van Hermelen, F., Porter, B. (eds.) Handbook of Knowledge Representation. Elsevier, San Diego (2008)Google Scholar
- 9.Pearl, J.: System Z: A natural ordering of defaults with tractable applications to default reasoning. In: Proceedings of the 3rd TARK Conference (1990)Google Scholar