Resumen de Fold\Unfold transformation of Knowledge: bases under approximate reasoning
Folding and unfolding are two key program transformation techniques of wide application in logic programming. We present in this paper a natural extension of folding and unfolding for knowledge bases under approximate reasoning that preserves semantics of the knowledge base if the uncertainties of the involved rules satisfy given equations. The equations both state the minimal conditions governing the folding and unfolding of uncertain rules and define the result of the fold resp. unfold operation.
