On Transformations and Normal Forms of Conditional Knowledge Bases
Background knowledge is often represented by sets of conditionals of the form “if A then usually B”. Such knowledge bases should not be circuitous, but compact and easy to compare in order to allow for efficient processing in approaches dealing with and inferring from background knowledge, such as nonmonotonic reasoning. In this paper we present transformation systems on conditional knowledge bases that allow to identify and remove unnecessary conditionals from the knowledge base while preserving the knowledge base’s model set.
- 1.B. de Finetti. La prévision, ses lois logiques et ses sources subjectives. Ann. Inst. H. Poincaré, 7(1):1–68, 1937. Engl. transl. Theory of Probability, J. Wiley & Sons, 1974Google Scholar
- 3.G. Kern-Isberner. Conditionals in Nonmonotonic Reasoning and Belief Revision - Considering Conditionals as Agents. Number 2087 in Lecture Notes in Computer Science. Springer Science+Business Media, Berlin, DE, 2001Google Scholar
- 4.Pearl, J.: System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning. In: Parikh, R. (ed.) Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge (TARK1990). pp, pp. 121–135. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA (1990)Google Scholar