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.
CITATION STYLE
Beierle, C., Eichhorn, C., & Kern-Isberner, G. (2017). On transformations and normal forms of conditional knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10350 LNCS, pp. 488–494). Springer Verlag. https://doi.org/10.1007/978-3-319-60042-0_53
Mendeley helps you to discover research relevant for your work.