In this paper, the authors give a transition system for those abstractive knowledge bases with the form of so-called assertion set, which plays an important role in knowledge representation and processing, so that each such knowledge base possibly with contradictions can be eventually transferred into a consistent version of it. This leads to a calculus-like mechanism for producing R-reconstruction. This transition system is proved to be sound and complete.