Brewka's framework for default logic is extended such that this new fr
amework is possessed of more powerful expressivity when reasoning by c
ases. Under this extended framework a characterization of extensions o
f a default theory is given. From this characterization the algorithms
for main reasoning tasks in default logic with case reasoning are der
ived.