Correct Parallel Status Assignments for the Reason Maintenance System

This paper represents a beginning development of a parallel truth maintenance system to interact with a parallel inference engine. We present a solution which performs status assignments in parallel to belief nodes in the Reason Maintenance System (RMS) presented by [3],[4]. We examine a previously described algorithms by [7] which fails to correctly detect termination of the status assignments. Under Petrie\u27s algorithm, termination may go undetected an in certain circumstances (namely the existence of an unsatisfiable circularity) a false detection may occur. We present an algorithm that corrects these problems